COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
We consider the existence and efficient construction of bounded curvature paths traversing constant-width regions of the plane, called corridors. We make explicit a width threshol...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...