Spatial embedding of pseudo-triangulations

Authors:
Oswin Aichholzer;Franz Aurenhammer;Peter Braay
Affiliations:
Graz University of Technology, Graz, Austria;Graz University of Technology, Graz, Austria;Freie Universitat Berlin, Berlin, Germany
Venue:
Proceedings of the nineteenth annual symposium on Computational geometry
Year:
2003

Citing 11
Cited 1

Power diagrams: properties, algorithms and applications

SIAM Journal on Computing
Properties of n-dimensional triangulations

Computer Aided Geometric Design
A relationship between Gale transforms and Voronoi diagrams

Discrete Applied Mathematics
Three-dimensional alpha shapes

ACM Transactions on Graphics (TOG)
Minimal tangent visibility graphs

Computational Geometry: Theory and Applications
Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations

Journal of Algorithms
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons

Proceedings of the eighteenth annual symposium on Computational geometry
Sequences of spanning trees and a fixed tree theorem

Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
Tight degree bounds for pseudo-triangulations of points

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
A combinatorial approach to planar non-colliding robot arm motion planning

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Planar minimally rigid graphs and pseudo-triangulations

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003

Minimum weight pseudo-triangulations

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We show that pseudo-triangulations have natural embeddings in three-space. As a consequence, various concepts for triangulations, like flipping to optimality, (constrained) Delaunayhood, and a polytope representation carry over to pseudo-triangulations.