839 search results - page 156 / 168 » Three-Clustering of Points in the Plane |
SWAT
1998
Springer
13 years 12 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
VIS
2005
IEEE
14 years 9 months ago
2005
IEEE
Tensor topology is useful in providing a simplified and yet detailed representation of a tensor field. Recently the field of 3D tensor topology is advanced by the discovery that d...
GD
2007
Springer
14 years 1 months ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
When studying a 3D polyhedron, it is often easier to cut it open and
atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...