A New Concept and Method for Line Clipping
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 987412
- A Speculative Approach to Clipping Line Segments
- Line clipping against polygonal window algorithm based on the multiple virtual boxes rejecting
- scientific article; zbMATH DE number 176247
- An efficient algorithm to clip a 2D-polygon against a rectangular clip window
Cited in
(17)- An efficient algorithm to clip a 2D-polygon against a rectangular clip window
- scientific article; zbMATH DE number 987412 (Why is no real title available?)
- Performing geometric transformations by program transformation
- Line clipping against polygonal window algorithm based on the multiple virtual boxes rejecting
- A new 3D line-generating algorithm based on line property and projecting
- A new, fast method for 2D polygon clipping
- scientific article; zbMATH DE number 176247 (Why is no real title available?)
- scientific article; zbMATH DE number 1919433 (Why is no real title available?)
- scientific article; zbMATH DE number 7578492 (Why is no real title available?)
- A Speculative Approach to Clipping Line Segments
- Optimized line and line segment clipping in E2 and geometric algebra
- A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic
- Extension of the Nicholls-Lee-Nichols algorithm to three dimensions
- 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)
- Parsimonious simplicial intersection algorithm
- Intersection of tetrahedra
This page was built for publication: A New Concept and Method for Line Clipping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716328)
