1879 search results - page 343 / 376 » Computational geometry algorithms library |
265
Voted
COMPGEOM
2010
ACM
16 years 15 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
278
Voted
COMPGEOM
2010
ACM
16 years 15 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
206
Voted
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
204
click to vote
RT
2004
Springer
16 years 23 days ago
2004
Springer
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...
259
click to vote
CSB
2003
IEEE
16 years 21 days ago
2003
IEEE
Recognition of a protein’s fold provides valuable information about its function. While many sequence-based homology prediction methods exist, an important challenge remains: tw...