Name
Abstract | ||
|---|---|---|
This article presents a simple hierarchical adaptation of the marching cubes algorithm for polygonizing variational implicit surfaces used in modelling and reconstruction applications. The technique relies on placing the normal and boundary constraint points respecting pseudo-Euclidean distance metrics. This procedure makes it possible to quickly prune the space and minimize the number of costly function evaluations and thus converge rapidly to the surface. Timings show that this technique tends to perform faster than Bloomenthal's (1994) continuation polygonizer. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/SIBGRA.2004.1352969 | SIBGRAPI |
Keywords | Field | DocType |
computational geometry,data visualisation,image reconstruction,image sampling,boundary constraint points,convergence,fast polygonization,function evaluations,hierarchical adaptation,marching cubes algorithm,modelling,pseudo-Euclidean distance metrics,reconstruction,space pruning,variational implicit surfaces | Iterative reconstruction,Mathematical optimization,Data visualization,Marching cubes,Continuation,Computational geometry,Marching tetrahedra,Algorithm,Polygonizer,Mathematics,Image sampling | Conference |
ISSN | ISBN | Citations |
1530-1834 | 0-7695-2227-0 | 1 |
PageRank | References | Authors |
0.34 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alvaro Cuno | 1 | 6 | 1.51 |
| Claudio Esperança | 2 | 13 | 4.79 |
| Antonio Oliveira | 3 | 6 | 2.54 |
| Paulo Roma Cavalcanti | 4 | 75 | 10.18 |