ACM Home Page
Please provide us with feedback. Feedback
Multi-level partition of unity implicits
Full text MovMov (26:06),  PdfPdf (6.57 MB)
Source ACM Transactions on Graphics (TOG) archive
Volume 22 ,  Issue 3  (July 2003) table of contents
Proceedings of ACM SIGGRAPH 2003
SESSION: Surfaces table of contents
Pages: 463 - 470  
Year of Publication: 2003
ISSN:0730-0301
Also published in ...
Authors
Yutaka Ohtake  MPI Informatik
Alexander Belyaev  MPI Informatik
Marc Alexa  TU Darmstadt
Greg Turk  Georgia Tech
Hans-Peter Seidel  MPI Informatik
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 29,   Downloads (12 Months): 190,   Citation Count: 93
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/882262.882293
What is a DOI?

ABSTRACT

We present a new shape representation, the multi-level partition of unity implicit surface, that allows us to construct surface models from very large sets of points. There are three key ingredients to our approach: 1) piecewise quadratic functions that capture the local shape of the surface, 2) weighting functions (the partitions of unity) that blend together these local shape functions, and 3) an octree subdivision method that adapts to variations in the complexity of the local shape.Our approach gives us considerable flexibility in the choice of local shape functions, and in particular we can accurately represent sharp features such as edges and corners by selecting appropriate shape functions. An error-controlled subdivision leads to an adaptive approximation whose time and memory consumption depends on the required accuracy. Due to the separation of local approximation and local blending, the representation is not global and can be created and evaluated rapidly. Because our surfaces are described using implicit functions, operations such as shape blending, offsets, deformations and CSG are simple to perform.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
BABUŠKA, I., AND MELENK, J. M. 1997. The partition of unity method. International Journal of Numerical Methods in Engineering 40, 727--758.
 
4
5
 
6
 
7
BERNARDINI, F., BAJAJ, C., CHEN, J., AND SCHIKORE, D. 1999. Automatic reconstruction of 3D CAD models from digital scans. International Journal of Computational Geometry & Applications 9, 4, 327--369.
8
 
9
 
10
11
 
12
CURLESS, B. VripPack User's Guide. http://graphics.stanford.edu/software/vrip/.
13
 
14
DINH, H. Q., SLABAUGH, G., AND TURK, G. 2001. Reconstructing surfaces using anisotropic basis functions. In International Conference on Computer Vision (ICCV) 2001, 606--613.
 
15
16
17
 
18
FRANKE, R., AND NIELSON, G. 1980. Smooth interpolation of large sets of scattered data. International Journal of Numerical Methods in Engineering 15, 1691--1704.
 
19
 
20
 
21
 
22
HART, J. C. 1996. Sphere tracing: a geometric method for the antialiased ray tracing of implicit surfaces. The Visual Computer 12, 527--545.
23
 
24
HYPERFUN: F-REP LIBRARY. http://cis.k.hosei.ac.jp/F-rep/HF_lib.html.
 
25
ISKE, A., AND LEVESLEY, J. 2002. Multilevel scattered data approximation by adaptive domain decomposition. Tech. rep., University of Leicester, April.
 
26
27
28
 
29
KOJEKINE, N., HAGIWARA, I., AND SAVCHENKO, V. 2003. Software tools using CSRBFs for processing scattered data. Computers & Graphics 27, 2 (April).
 
30
31
 
32
MOORE, D., AND WARREN, J. 1991. Approximation of dense scattered data using algebraic surfaces. In Proceedings of the 24th Hawaii International Conference on System Sciences, IEEE Computer Society Press, Kauai, Hawaii, 681--690.
 
33
34
35
 
36
 
37
PASKO, A., AND SAVCHENKO, V. 1994. Blending operations for the functionally based constructive geometry. In Set-theoretic Solid Modeling: Techniques and Applications, CSG 94 Conference Proceedings, Information Geometers, 151--161.
38
 
39
RICCI, A. 1973. A constructive geometry for computer graphics. The Computer Journal 16, 2 (May), 157--160.
 
40
SAVCHENKO, V. V., PASKO, A. A., OKUNEV, O. G., AND KUNII, T. L. 1995. Function representation of solids reconstructed from scattered surface points and contours. Computer Graphics Forum 14, 4, 181--188.
 
41
SCHABACK, R., AND WENDLAND, H. 2000. Adaptive greedy techniques for approximate solution of large RBF systems. Numerical Algorithms 24, 239--254.
 
42
43
44
 
45
 
46
WENDLAND, H. 2002. Fast evaluation of radial basis functions: Methods based on partition of unity. In Approximation Theory X: Wavelets, Splines, and Applications, Vanderbilt University Press, Nashville, L. Schumaker and J. Stöckler, Eds., 473--483.
 
47
ZHAO, H., AND OSHER, S. 2002. Visualization, analysis and shape reconstruction of unorganized data sets. In Geometric Level Set Methods in Imaging, Vision and Graphics, Springer, S. Osher and N. Paragios, Eds.

CITED BY  94

Collaborative Colleagues:
Yutaka Ohtake: colleagues
Alexander Belyaev: colleagues
Marc Alexa: colleagues
Greg Turk: colleagues
Hans-Peter Seidel: colleagues