A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)
From MaRDI portal
Publication:6101444
DOI10.15388/23-infor508OpenAlexW4318215238MaRDI QIDQ6101444
Publication date: 20 June 2023
Published in: Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15388/23-infor508
geometrydualityconvex polygonprojective spacecomputer graphicsconvex polyhedronhomogeneous coordinatesline clippingintersection algorithmspolygon clippingline segment clippingtriangle-triangle intersection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A local search algorithm for ray-convex polyhedron intersection
- The computer graphics manual. 2 Volumes
- An efficient algorithm to clip a 2D-polygon against a rectangular clip window
- Modern Mathematics and Applications in Computer Graphics and Vision
- Matrix Transforms for Computer Games and Animation
- Repairing unstructured triangular mesh intersections
- Reentrant polygon clipping
- Line clipping against polygonal window algorithm based on the multiple virtual boxes rejecting
- Geometric Algebra: An Algebraic System for Computer Games and Animation
- A New Concept and Method for Line Clipping
- A new, fast method for 2D polygon clipping
- ERIT—A Collection of Efficient and Reliable Intersection Tests
- Understanding Geometric Algebra
- 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
This page was built for publication: A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)
