Tight degree bounds for pseudo-triangulations of points

DOI10.1016/S0925-7721(02)00126-8MaRDI QIDQ1873151zbMATH OpenDBLPWikidataFDO

Authors Lutz Kettner, Andrea Mantler, Bettina Speckmann, Fumihiko Takeuchi, David Kirkpatrick, Jack Snoeyink

Publication date 19 May 2003

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-7721(02)00126-8

zbMATH Keywords

degree boundsface degreepseudo-triangulationvertex degree

Mathematics Subject Classification ID

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

Recommendations

• On constrained minimum pseudotriangulations
• Minimum weight pseudo-triangulations
• Empty pseudo-triangles in point sets
• Transforming pseudo-triangulations

Cites work

• Applications of a semi-dynamic convex hull algorithm
• Deformable free space tilings for kinetic collision detection.
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• scientific article; zbMATH DE number 1617248 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 1786516 (Why is no real title available?)
• Kinetic collision detection for simple polygons
• Maintenance of configurations in the plane
• Minimal tangent visibility graphs
• Ray shooting in polygons using geodesic triangulations
• Topologically sweeping visibility complexes via pseudotriangulations

Cited in

(13)

• A vertex-face assignment for plane graphs
• Planar minimally rigid graphs and pseudo-triangulations
• On numbers of pseudo-triangulations
• Plane graphs with parity constraints
• Flip graphs of bounded degree triangulations
• On constrained minimum pseudotriangulations
• Plane Graphs with Parity Constraints
• Multitriangulations, pseudotriangulations and primitive sorting networks
• Flips in combinatorial pointed pseudo-triangulations with face degree at most four
• Convexity minimizes pseudo-triangulations
• Pointed binary encompassing trees: simple and optimal
• Empty pseudo-triangles in point sets
• On minimum weight pseudo-triangulations

This page was built for publication: Tight degree bounds for pseudo-triangulations of points

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