Optimization for first order Delaunay triangulations (Q2269140): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2009.01.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998766404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge insertion for optimal triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating realistic terrains with higher-order Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratic Time Algorithm for the Minmax Length Triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher order Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating planar graphs while minimizing the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Higher Order Delaunay Triangulations of Polygons / rank
 
Normal rank

Latest revision as of 14:02, 2 July 2024

scientific article
Language Label Description Also known as
English
Optimization for first order Delaunay triangulations
scientific article

    Statements

    Optimization for first order Delaunay triangulations (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2010
    0 references
    0 references
    higher order Delaunay triangulation
    0 references
    optimization
    0 references
    graphical examples
    0 references
    quality measures
    0 references
    maximum vertex degree
    0 references
    number of convex edges
    0 references
    number of mixed vertices
    0 references
    algorithms
    0 references
    0 references