Pre-triangulations and liftable complexes

Authors:
Oswin Aichholzer;Franz Aurenhammer;Thomas Hackl
Affiliations:
University of Technology, Graz, Austria;University of Technology, Graz, Austria;University of Technology, Graz, Austria
Venue:
Proceedings of the twenty-second annual symposium on Computational geometry
Year:
2006

Citing 8
Cited 2

Computational geometry: an introduction

Computational geometry: an introduction
Machine interpretation of line drawings

Machine interpretation of line drawings
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Properties of n-dimensional triangulations

Computer Aided Geometric Design
Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
A combinatorial approach to planar non-colliding robot arm motion planning

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip

SIAM Journal on Computing
The Polytope of Non-Crossing Graphs on a Planar Point Set

Discrete & Computational Geometry

Flip Algorithm for Segment Triangulations

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Triangulations of line segment sets in the plane

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce and discuss the concept of pre-triangulations, a relaxation of triangulations that goes beyond the well-established class of pseudo-triangulations.