Multiresolution banded refinement to accelerate surface reconstruction from polygons

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multiresolution banded refinement to accelerate surface reconstruction from polygons

Full text

Pdf (1.09 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the fourteenth annual symposium on Computational geometry table of contents

Minneapolis, Minnesota, United States

Pages: 240 - 248

Year of Publication: 1998

ISBN:0-89791-973-4

Authors

James D. Fix	Department of Computer Science and Engineering, University of Washington, Seattle, WA
Richard E. Ladner	Department of Computer Science and Engineering, University of Washington, Seattle, WA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 13, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/276884.276912 What is a DOI?

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	Helmut Alt , Michael Godau, Measuring the resemblance of polygonal curves, Proceedings of the eighth annual symposium on Computational geometry, p.102-109, June 10-12, 1992, Berlin, Germany [doi>10.1145/142675.142699]
	2	Chandrajit L. Bajaj , Edward J. Coyle , Kwun-Nan Lin, Arbitrary topology shape reconstruction from planar cross sections, Graphical Models and Image Processing, v.58 n.6, p.524-543, Nov. 1996 [doi>10.1006/gmip.1996.0044]
	3	Gill Barequet , Daniel Shapiro , Ayellet Tal, History consideration in reconstructing polyhedral surfaces from parallel slices, Proceedings of the 7th conference on Visualization '96, p.149-ff., October 28-29, 1996, San Francisco, California, United States
	4	Gill Barequet , Micha Sharir, Piecewise-linear interpolation between polygonal slices, Proceedings of the tenth annual symposium on Computational geometry, p.93-102, June 06-08, 1994, Stony Brook, New York, United States [doi>10.1145/177424.177562]
	5	Jean-Daniel Boissonnat, Shape reconstruction from planar cross sections, Computer Vision, Graphics, and Image Processing, v.44 n.1, p.1-29, Oct. 1988 [doi>10.1016/S0734-189X(88)80028-8]
	6	J.D. Boisssonnat and B. Geiger. Three dimensional reconstruction of complex shapes based on the Delauney triangulation. In Procedings of Biomedical image Processing and Biomedical Visualization, volume 1905, pages 964-975. SPIE Press, 1993.
	7	H. N. Christiansen , T. W. Sederberg, Conversion of complex contour line definitions into polygonal element mosaics, ACM SIGGRAPH Computer Graphics, v.12 n.3, p.187-192, August 1978
	8	M. Cohen, T. DeRose, D. Salesin, P. Schrfder, and W. Sweldens. Wavelets in computer graphics, 1996. ACM SIGGRAPtt Course Notes.
	9	H. Fuchs , Z. M. Kedem , S. P. Uselton, Optimal surface reconstruction from planar contours, Communications of the ACM, v.20 n.10, p.693-702, Oct. 1977 [doi>10.1145/359842.359846]
	10	S. Ganapathy , T. G. Dennehy, A new general triangulation method for planar contours, ACM SIGGRAPH Computer Graphics, v.16 n.3, p.69-75, July 1982
	11	Alan Kalvin , Edith Schonberg , Jacob T. Schwartz , Micha Sharir, Two-dimensional, model-based, boundary matching using footprints, International Journal of Robotics Research, v.5 n.4, p.38-55, Winter, 1987 [doi>10.1177/027836498600500403]
	12	E. Keppel. Approximating complex surfaces by triangulation of contour lines. IBM Journal of Research and Development, 19:2-15, 1975.
	13	Zicheng Liu , Steven J. Gortler , Michael F. Cohen, Hierarchical spacetime control, Proceedings of the 21st annual conference on Computer graphics and interactive techniques, p.35-42, July 1994 [doi>10.1145/192161.192169]
	14	D. Meyers. Multiresolution tiling. Computer Graphics Forum, 13(5):325-340, December 1994.
	15	David Meyers, Reconstruction of surfaces from planar contours, University of Washington, Seattle, WA, 1995
	16	David Meyers , Shelley Skinner , Kenneth Sloan, Surfaces from contours, ACM Transactions on Graphics (TOG), v.11 n.3, p.228-258, July 1992 [doi>10.1145/130881.131213]
	17	D. Sankoff and J. Kruskal, editors. Time Warps, String Edits, and Macromolecules: the Theory and Praciice of Sequence Comparison. Addison-Wesley, Reading, Mass., 1983.
	18	Thomas W. Sederberg , Eugene Greenwood, A physically based approach to 2–D shape blending, Proceedings of the 19th annual conference on Computer graphics and interactive techniques, p.25-34, July 1992
	19	Michael Shantz, Surface definition for branching, contour-defined objects, ACM SIGGRAPH Computer Graphics, v.15 n.2, July 1981 [doi>10.1145/988420.988426]
	20	Eric J. Stollnitz , Tony D. Derose , David H. Salesin, Wavelets for computer graphics: theory and applications, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1996
	21	W. Sweldens and P. SchrSder. Building your own wavelets at home. Technical Report 1995:5, Department of Mathematics, University of South Carolina, 1995.
	22	Emo Welzl , Barbara Wolfers, Surface reconstruction between simple polygons via angle criteria, Journal of Symbolic Computation, v.17 n.4, p.351-369, April 1994 [doi>10.1006/jsco.1994.1024]
	23	H. J. Wolfson, On curve matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.5, p.483-489, May 1990 [doi>10.1109/34.55108]