387 search results - page 20 / 78 » Towards in-place geometric algorithms and data structures |
93
Voted
SODA
2003
ACM
15 years 1 months ago
2003
ACM
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
115
click to vote
ISBI
2002
IEEE
16 years 1 months ago
2002
IEEE
Conventional deformable registration methods are mostly driven by the interface between different brain structures. In recent years, Diffusion Tensor Magnetic Resonance Imaging (D...
115
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
PAMI
1998
15 years 3 days ago
1998
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
TVCG
2008
15 years 10 days ago
2008
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...