Visualization algorithm for CSG polyhedral solids

DOI10.1016/0010-4485(87)90089-3MaRDI QIDQ1109516zbMATH OpenOpenAlexFDO

Authors Anne Verroust

Publication date 1987

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01225212/file/cad_csg.pdf

zbMATH Keywords

constructive solid geometryhidden surface algorithmray-castingsolid modelling

Mathematics Subject Classification ID

Descriptive geometry (51N05) Algorithms for approximation of functions (65D15)

Review text

An algorithm is presented here to visualize constructive solid geometry (CSG) solids in wireframe with hidden faces eliminated. The approach taken is to construct the image of the CSG solid directly from the CSG tree. This algorithm takes into account the face coherence property and the depth of the faces to minimize the number of rays fired during the process. It mixes a two-dimensional polygonal clipping and a ray-casting algorithm.

Recommendations

• Creation and boundary evaluation of CSG-models
• An efficient algorithm for finding the CSG representation of a simple polygon
• scientific article; zbMATH DE number 3866617
• Hidden surface removal for \(c\)-oriented polyhedra
• Computing CSG-tree boundaries as algebraic expressions

Cited in

(2)

• Rasterizing complex polygons without tessellations
• Extension of the Nicholls-Lee-Nichols algorithm to three dimensions

This page was built for publication: Visualization algorithm for CSG polyhedral solids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109516)