This chapter discusses the design of classes for geometric objects in three dimensions and the predicates and intersection functions that arise in space. Since many of the ideas encountered while designing classes for 2D in Chapter 1 are similar to those in 3D, the pace is somewhat faster.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2008). 3D Computational Euclidean Geometry. In: Introduction to Geometric Computing. Springer, London. https://doi.org/10.1007/978-1-84800-115-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-84800-115-2_3
Publisher Name: Springer, London
Print ISBN: 978-1-84800-114-5
Online ISBN: 978-1-84800-115-2
eBook Packages: Computer ScienceComputer Science (R0)