1672 search results - page 80 / 335 » Tightness problems in the plane |
117
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...
142
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
167
Voted
DAC
1989
ACM
15 years 9 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
145
click to vote
GD
2006
Springer
15 years 9 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
181
click to vote
AIPS
2003
15 years 7 months ago
2003
Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study o...