Sciweavers

138 search results - page 24 / 28
» K-Guarding Polygons on the Plane
Sort
View
SIGGRAPH
1990
ACM
15 years 2 months ago
Cone-spheres
This paper proposes to use relief-mapped conical frusta (cones cut by planes) to skin skeletal objects. Based on this representation, current programmable graphics hardware can pe...
Nelson L. Max
CCCG
2008
14 years 11 months ago
Guaranteed Voronoi Diagrams of Uncertain Sites
In this paper we investigate the Voronoi diagram that is induced by a set of sites in the plane, where each site's precise location is uncertain but is known to be within a p...
Jeff Sember, William Evans
90
Voted
CCCG
2008
14 years 11 months ago
Smallest enclosing circle centered on a query line segment
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
Prosenjit Bose, Stefan Langerman, Sasanka Roy
116
Voted
CCCG
2003
14 years 11 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
88
Voted
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
14 years 11 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...