On the public citation graph
An efficient algorithm for line and polygon clipping
0 signed · 53 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1016/0146-664x(82)90117-4openalex-snapshot
Fundamentals of interactive computer graphics
inferredcites →https://doi.org/10.1016/s0019-9958(86)80033-xopenalex-snapshot
Sorting jordan sequences in linear time using level-linked search trees
inferredcites →https://doi.org/10.1109/2.16223openalex-snapshot
The problems of accuracy and robustness in geometric computation
inferredcites →https://doi.org/10.1109/proc.1985.13108openalex-snapshot
Boolean operations in solid modeling: Boundary evaluation and merging algorithms
inferredcites →https://doi.org/10.1145/182.358439openalex-snapshot
An analysis and algorithm for polygon clipping
inferredcites →https://doi.org/10.1145/37401.37432openalex-snapshot
An efficient new algorithm for 2-D line clipping: Its development and analysis
inferredcites →https://doi.org/10.1145/37402.37432openalex-snapshot
An efficient new algorithm for 2-D line clipping: Its development and analysis
inferredcites →https://doi.org/10.1145/563858.563896openalex-snapshot
Hidden surface removal using polygon area sorting
inferredcites →https://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.1145/7531.24036openalex-snapshot
Intersection of convex objects in two and three dimensions
inferredcites →https://doi.org/10.1145/965141.563896openalex-snapshot
Hidden surface removal using polygon area sorting
inferredcites →https://doi.org/10.2307/1573035openalex-snapshot
Principles of Interactive Computer Graphics
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/vis.4340040107openalex-snapshot
The same origin ray set query for realistic illumination: Algorithm and analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-74032-0_9openalex-snapshot
Computing Gripping Points in 2D Parallel Surfaces Via Polygon Clipping
inferred← citeshttps://doi.org/10.1007/978-3-030-86976-2_1openalex-snapshot
A Novel Line Convex Polygon Clipping Algorithm in E2 with Parallel Processing Modification
inferred← citeshttps://doi.org/10.1007/978-3-030-86976-2_2openalex-snapshot
A New Coding Scheme for Line Segment Clipping in E2
inferred← citeshttps://doi.org/10.1007/978-981-19-4136-8_17openalex-snapshot
TextGen3D: A Real-Time 3D-Mesh Generation with Intersecting Contours for Text
inferred← citeshttps://doi.org/10.1007/bf01900665openalex-snapshot
2D line and polygon clipping based on space subdivision
inferred← citeshttps://doi.org/10.1007/s00371-005-0305-3openalex-snapshot
A new approach to line and line segment clipping in homogeneous coordinates
inferred← citeshttps://doi.org/10.1007/s00371-024-03413-3openalex-snapshot
A new fully projective O(lg N) line convex polygon intersection algorithm
inferred← citeshttps://doi.org/10.1007/s00371-024-03693-9openalex-snapshot
A new fully projective O(log N) point-in-convex polygon algorithm: a new strategy
inferred← citeshttps://doi.org/10.1007/s11766-022-4556-0openalex-snapshot
An efficient algorithm to clip a 2D-polygon against a rectangular clip window
inferred← citeshttps://doi.org/10.1007/s12206-019-1047-xopenalex-snapshot
A clipping algorithm on non-conformal interface for heat conduction analysis
inferred← citeshttps://doi.org/10.1007/s42405-022-00529-5openalex-snapshot
Verification Study of Locally Partitioned Interpolation Method for Patched-Grid Algorithm
inferred← citeshttps://doi.org/10.1016/0097-8493(93)90030-dopenalex-snapshot
An efficient algorithm for line clipping by convex polygon
inferred← citeshttps://doi.org/10.1016/0097-8493(94)90064-7openalex-snapshot
O(lgN) line clipping algorithm in E2
inferred← citeshttps://doi.org/10.1016/j.cad.2016.07.004openalex-snapshot
Re2l: An efficient output-sensitive algorithm for computing Boolean operations on circular-arc polygons and its applications
inferred← citeshttps://doi.org/10.1016/j.cageo.2006.08.008openalex-snapshot
An algorithm for polygon clipping, and for determining polygon intersections and unions
inferred← citeshttps://doi.org/10.1016/j.gmod.2026.101329openalex-snapshot
A framework for symmetric self-intersecting surfaces
inferred← citeshttps://doi.org/10.1080/16864360.2006.10738483openalex-snapshot
An Extension of Polygon Clipping To Resolve Degenerate Cases
inferred← citeshttps://doi.org/10.1109/cgi.2004.1309220openalex-snapshot
A new line clipping algorithm with hardware acceleration
inferred← citeshttps://doi.org/10.1109/cgi.2004.5openalex-snapshot
A new line clipping algorithm with hardware acceleration
inferred← citeshttps://doi.org/10.1109/informatics62280.2024.10900927openalex-snapshot
A New Projective Point in Convex Polygon Test with O(log N) Complexity*
inferred← citeshttps://doi.org/10.1109/isparo60631.2024.10687527openalex-snapshot
A Modular High-Fidelity Photorealistic Simulator of Orbital Scenarios: A Space Debris Removal Use Case
inferred← citeshttps://doi.org/10.1109/tkde.2014.2345402openalex-snapshot
Probabilistic Range Query over Uncertain Moving Objects in Constrained Two-Dimensional Space
inferred← citeshttps://doi.org/10.1117/12.3007366openalex-snapshot
Comparison of 4 vector polygon clipping algorithms in the spatial overlay analysis of GIS using simple feature model
inferred← citeshttps://doi.org/10.1145/112515.112538openalex-snapshot
The n-dimensional extended convex differences tree (ECDT) for representing polyhedra
inferred← citeshttps://doi.org/10.1145/274363.274364openalex-snapshot
Efficient clipping of arbitrary polygons
inferred← citeshttps://doi.org/10.1145/3513264openalex-snapshot
A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic
inferred← citeshttps://doi.org/10.15388/23-infor508openalex-snapshot
A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)
inferred← citeshttps://doi.org/10.20380/gi1990.22openalex-snapshot
Using convex differences in hierarchical representations of polygonal maps
inferred← citeshttps://doi.org/10.2312/eggh/eggh92/024-043openalex-snapshot
Accelerating Polygon Clipping
inferred← citeshttps://doi.org/10.33039/ami.2020.05.001openalex-snapshot
Optimized line and line segment clipping in E2 and Geometric Algebra
inferred← citeshttps://doi.org/10.3390/jimaging8100286openalex-snapshot
Line Clipping in 2D: Overview, Techniques and Algorithms
inferred← citeshttps://doi.org/10.3390/sym10100477openalex-snapshot
Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1403.0917openalex-snapshot
An Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1801.00442openalex-snapshot
O(lgN) Line Clipping Algorithm in E2
inferred← citeshttps://doi.org/10.4995/thesis/10251/15406openalex-snapshot
Aplicaciones de la aritmética en coma fija a la representación de primitivas gráficas de bajo nivel.
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.