Convexity minimizes pseudo-triangulations

DOI10.1016/J.COMGEO.2004.01.002zbMATH Open1056.65013DBLPjournals/comgeo/AichholzerAKS04OpenAlexW2170949858WikidataQ29038757 ScholiaQ29038757MaRDI QIDQ598549FDOQ598549

Authors: Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann 

Publication date: 6 August 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.01.002

Recommendations

• On constrained minimum pseudotriangulations
• Tight degree bounds for pseudo-triangulations of points
• Empty pseudo-triangles in point sets
• Pseudo-triangulations -- a survey
• Minimum weight pseudo-triangulations

zbMATH Keywords

computational geometrylower boundedge flippseudo triangulation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• A lower bound on the number of triangulations of planar point sets
• Title not available (Why is that?)
• Enumerating order types for small point sets with applications
• Topologically sweeping visibility complexes via pseudotriangulations
• Ray shooting in polygons using geodesic triangulations
• Tight degree bounds for pseudo-triangulations of points
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• Minimal tangent visibility graphs
• Deformable free space tilings for kinetic collision detection.
• Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
• Title not available (Why is that?)
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• Planar minimally rigid graphs and pseudo-triangulations
• On the crossing number of complete graphs

Cited In (11)

• Multitriangulations, pseudotriangulations and primitive sorting networks
• Planar minimally rigid graphs and pseudo-triangulations
• A new lower bound on the maximum number of plane graphs using production matrices
• A lower bound on the number of triangulations of planar point sets
• Empty pseudo-triangles in point sets
• Enumerating pseudo-triangulations in the plane
• On the number of plane geometric graphs
• On the number of pseudo-triangulations of certain point sets
• On the number of crossing-free partitions
• The stochastic walk algorithms for point location in pseudo-triangulations
• On constrained minimum pseudotriangulations

This page was built for publication: Convexity minimizes pseudo-triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598549)