Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COMPGEOM
1999
ACM

favoriteEmaildiscussreport

110views Discrete Geometry» more COMPGEOM 1999»

The Path of a Triangulation

13 years 9 months ago

The Path of a Triangulation

Download dimacs.rutgers.edu

We deﬁne the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of approaches for suitable (i.e. decomposable) problems on pseudo-triangulations. We illustrate this method by presenting a novel algorithm that counts the number of pseudo-triangulations of a point set.

Oswin Aichholzer

Real-time Traffic

COMPGEOM 1999 | Data Structure | Discrete Geometry | Divide-andconquer Type | Generalizing |

claim paper

Related Content

» Online Routing in Triangulations

» Competitive Online Routing in Geometric Graphs

» PolynomialSize Nonobtuse Triangulation of Polygons

» Decomposing a Simple Polygon into Trapezoids

» Energy and length in a topological planar quadrilateral

» A bijection between 2triangulations and pairs of noncrossing Dyck paths

» A Theory of Refractive and Specular 3D Shape by LightPath Triangulation

» Enumerating Triangulation Paths

» A ContourBased Approach to 3D Text Labeling on Triangulated Surfaces

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	1999
Where	COMPGEOM
Authors	Oswin Aichholzer

Comments (0)