2980 search results - page 457 / 596 » Computational Geometry |
161
click to vote
SODA
2004
ACM
15 years 7 months 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...
199
click to vote
PUK
2003
15 years 7 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
158
click to vote
VISSYM
2003
15 years 7 months ago
2003
We show how to extract a contour line (or isosurface) from quadratic elements—specifically from quadratic triangles and tetrahedra. We also devise how to transform the resultin...
168
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
159
click to vote
CCCG
1993
15 years 7 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...