1879 search results - page 315 / 376 » Computational geometry algorithms library |
155
click to vote
CGF
2008
15 years 4 months ago
2008
We present a novel approach to parameterize a mesh with disk topology to the plane in a shape-preserving manner. Our key contribution is a local/global algorithm, which combines a...
195
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
134
click to vote
COMPGEOM
2005
ACM
15 years 6 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...
126
click to vote
COMPGEOM
2005
ACM
15 years 6 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...
151
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...