Sciweavers

204 search results - page 1 / 41
» On Constrained Minimum Pseudotriangulations
Sort
View
COCOON
2003
Springer
14 years 26 days ago
On Constrained Minimum Pseudotriangulations
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
Günter Rote, Cao An Wang, Lusheng Wang, Yin-F...
COMGEO
2010
ACM
13 years 7 months ago
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
COMGEO
2004
ACM
13 years 7 months ago
Convexity minimizes pseudo-triangulations
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasse...
CCCG
2001
13 years 9 months ago
Tight degree bounds for pseudo-triangulations of points
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
Lutz Kettner, David G. Kirkpatrick, Bettina Speckm...
FSTTCS
2004
Springer
14 years 1 months ago
Minimum Weight Pseudo-Triangulations
In this note we discuss some structural properties of minimum weight (pointed) pseudo-triangulations.
Joachim Gudmundsson, Christos Levcopoulos