This chapter deals with spatial partitioning algorithms for rendering implicit surfaces. Typically, these algorithms start with a preliminary space decomposition of the domain (e.g. bounding box) into smaller subdomains or cells (e.g. cubic boxes), discarding those cells that do not intersect the surface. The surface is then polygonised or approximated by one or more polygons within each intersecting cell in order to render it on screen.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2009). Spatial Partitioning Methods. In: Gomes, A.J.P., Voiculescu, I., Jorge, J., Wyvill, B., Galbraith, C. (eds) Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms. Springer, London. https://doi.org/10.1007/978-1-84882-406-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-84882-406-5_7
Publisher Name: Springer, London
Print ISBN: 978-1-84882-405-8
Online ISBN: 978-1-84882-406-5
eBook Packages: Computer ScienceComputer Science (R0)