101 search results - page 3 / 21 » A lower bound on the number of triangulations of planar poin... |
COMGEO
2006
ACM
13 years 6 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
COMGEO
2008
ACM
13 years 6 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
CORR
2002
Springer
13 years 6 months ago
2002
Springer
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...