2681 search results - page 228 / 537 » Problem F |
88
Voted
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
97
Voted
GLVLSI
2003
IEEE
15 years 6 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
96
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
170
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
194
Voted
GIS
2006
ACM
16 years 1 months ago
2006
ACM
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...