On the public citation graph

3D-line clipping algorithms — a comparative study

0 signed · 17 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/978-3-642-69900-9openalex-snapshot

Data Structures and Algorithms 3

inferredcites →https://doi.org/10.1007/bfb0046097openalex-snapshot

Efficient Structures for Geometric Data Management

inferredcites →https://doi.org/10.1016/0097-8493(78)90021-3openalex-snapshot

Generalized two- and three-dimensional clipping

inferredcites →https://doi.org/10.1016/0097-8493(94)90064-7openalex-snapshot

O(lgN) line clipping algorithm in E2

inferredcites →https://doi.org/10.1111/1467-8659.1410003openalex-snapshot

Line Clipping Using Semi‐Homogeneous Coordinates

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.1007/978-981-97-9578-9_18openalex-snapshot

Image Extraction for Linear Segment in 3D Space

inferred← citeshttps://doi.org/10.1007/s003710050088openalex-snapshot

Convex polyhedron-line intersection detection using dual representation

inferred← citeshttps://doi.org/10.1080/13658816.2020.1778004openalex-snapshot

Spatiotemporal coverage analysis of moving regions

inferred← citeshttps://doi.org/10.1145/3729532openalex-snapshot

Intersection of Tetrahedra

inferred← citeshttps://doi.org/10.12988/ams.2013.37372openalex-snapshot

Intersection of a line and a convex hull of points cloud

inferred← citeshttps://doi.org/10.12988/ams.2014.4133openalex-snapshot

Line-convex polyhedron intersection using vertex connections table

inferred← citeshttps://doi.org/10.12988/ams.2015.52169openalex-snapshot

Modified Skala’s plane tested algorithm for line–polyhedron intersection

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.3390/a16040201openalex-snapshot

Line Clipping in 3D: Overview, Techniques and Algorithms

inferred← citeshttps://doi.org/10.3390/s16030283openalex-snapshot

Registration of Feature-Poor 3D Measurements from Fringe Projection

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.