Abstract
This chapter introduces the problem of (hierarchical) approximation and localization of polygonal and polyhedral objects, and presents several approximation error criteria. An overview of existing boundary-based intrinsic schemes as well as some other work on approximation and localization are given.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1994). Approximation and localization. In: Closed Object Boundaries from Scattered Points. Lecture Notes in Computer Science, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58808-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-58808-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58808-5
Online ISBN: 978-3-540-49108-8
eBook Packages: Springer Book Archive