A line clipping algorithm uses quadrilateral concavity and convexity to reject non-intersecting segments before computing intersections, avoiding false points and reducing divisions.
A New Concept and Method for Line Clipping
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Line Segment Clipping using Quadrilateral Concavity and Convexity
A line clipping algorithm uses quadrilateral concavity and convexity to reject non-intersecting segments before computing intersections, avoiding false points and reducing divisions.