Tight degree bounds for pseudo-triangulations of points

DOI10.1016/S0925-7721(02)00126-8zbMath1023.65013WikidataQ56970662 ScholiaQ56970662MaRDI QIDQ1873151

Fumihiko Takeuchi, Lutz Kettner, Andrea Mantler, Bettina Speckmann, David G. Kirkpatrick, Jack Scott Snoeyink

Publication date: 19 May 2003

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

zbMATH Keywords

degree boundsvertex degreepseudo-triangulationface degree

Mathematics Subject Classification ID

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

Related Items

Flip graphs of bounded degree triangulations, Plane Graphs with Parity Constraints, Convexity minimizes pseudo-triangulations, Multitriangulations, pseudotriangulations and primitive sorting networks, Plane graphs with parity constraints, On minimum weight pseudo-triangulations, Planar minimally rigid graphs and pseudo-triangulations, Pointed binary encompassing trees: simple and optimal, A vertex-face assignment for plane graphs, FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintenance of configurations in the plane
• Applications of a semi-dynamic convex hull algorithm
• Ray shooting in polygons using geodesic triangulations
• Topologically sweeping visibility complexes via pseudotriangulations
• Minimal tangent visibility graphs
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• Kinetic collision detection for simple polygons