1245 search results - page 3 / 249 » Triangulation for Points on Lines |
SODA
2004
ACM
14 years 7 days ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
SODA
1992
ACM
14 years 16 hour ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
COMGEO
2006
ACM
13 years 11 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...
ALGORITHMICA
1998
13 years 10 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...