62 search results - page 7 / 13 » Triangulations of Line Segment Sets in the Plane |
146
Voted
JUCS
2007
15 years 1 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
142
Voted
3DGIS
2006
Springer
15 years 7 months ago
2006
Springer
The modelling or reconstruction of buildings has two aspects – on the one hand we need a data structure and the associated geometric information, and on the other hand we need a...
116
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
151
click to vote
DMTCS
2010
14 years 11 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
122
click to vote
GD
2006
Springer
15 years 5 months ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...