Extension of the Nicholls-Lee-Nichols algorithm to three dimensions

DOI10.1007/S003710000094MaRDI QIDQ5944404zbMATH OpenOpenAlexFDO

Authors Václav Skala, Duc Huy Bui

Publication date 18 November 2001

Published in The Visual Computer (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003710000094

zbMATH Keywords

computer graphicsline clipping

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• A New Concept and Method for Line Clipping
• Optimized line and line segment clipping in E2 and geometric algebra
• A new, fast method for 2D polygon clipping
• Visualization algorithm for CSG polyhedral solids
• scientific article; zbMATH DE number 987412

Cited in

(4)

• A new 3D line-generating algorithm based on line property and projecting
• Optimized line and line segment clipping in E2 and geometric algebra
• Line clipping based on parallelism approach and midpoint intersection
• A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)

This page was built for publication: Extension of the Nicholls-Lee-Nichols algorithm to three dimensions

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