3025 search results - page 451 / 605 » Computational geometry: a retrospective |
158
click to vote
COMPGEOM
2005
ACM
15 years 8 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...
180
click to vote
COMPGEOM
2005
ACM
15 years 8 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...
150
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
In many applications it is often desirable to maintain a valid mesh within a certain domain that deforms over time. During a period for which the underlying mesh topology remains ...
181
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
221
click to vote
SIMVIS
2007
15 years 7 months ago
2007
The amount of data to be represented by visualization systems requires new ideas for data processing and representation. As proposed in this contribution, this might be solved by ...