On the public citation graph
A fast line-sweep algorithm for hidden line elimination
0 signed · 54 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/bfb0030329openalex-snapshot
Solving visibility problems by using skeleton structures
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1109/tc.1980.1675628openalex-snapshot
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
inferredcites →https://doi.org/10.1109/tc.1981.6312179openalex-snapshot
Comments on “algorithms for reporting and counting geometric intersections”
inferredcites →https://doi.org/10.1145/563858.563895openalex-snapshot
Raster-scan hidden surface algorithm techniques
inferredcites →https://doi.org/10.1145/800224.806785openalex-snapshot
A visible polygon reconstruction algorithm
inferredcites →https://doi.org/10.1145/965141.563895openalex-snapshot
Raster-scan hidden surface algorithm techniques
inferredcites →https://doi.org/10.1145/965161.806785openalex-snapshot
A visible polygon reconstruction algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/gmip.1997.0440openalex-snapshot
Visibility Computation on Reconfigurable Meshes
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_73openalex-snapshot
Spatial point location and its applications
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_35openalex-snapshot
Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
inferred← citeshttps://doi.org/10.1007/978-3-642-60607-6_25openalex-snapshot
Contour Edge Analysis for Polyhedron Projections
inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_40openalex-snapshot
Methoden zur Visualisierung räumlicher geometrischer Daten
inferred← citeshttps://doi.org/10.1007/bf01190509openalex-snapshot
Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
inferred← citeshttps://doi.org/10.1007/bf01293267openalex-snapshot
An improved technique for output-sensitive hidden surface removal
inferred← citeshttps://doi.org/10.1007/bf01901191openalex-snapshot
Hidden-surface removal in polyhedral cross-sections
inferred← citeshttps://doi.org/10.1007/bf01935050openalex-snapshot
Reconstructing visible regions from visible segments
inferred← citeshttps://doi.org/10.1007/bfb0032067openalex-snapshot
An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90062-3openalex-snapshot
Hidden line elimination for isooriented rectangles
inferred← citeshttps://doi.org/10.1016/0097-8493(91)90053-kopenalex-snapshot
Local search: A new hidden line elimination algorithm to display spherical coordinate equations
inferred← citeshttps://doi.org/10.1016/0734-189x(85)90159-8openalex-snapshot
A fast algorithm for the Boolean masking problem
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00016-uopenalex-snapshot
An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90007-fopenalex-snapshot
Hidden surface removal for c-oriented polyhedra
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90024-mopenalex-snapshot
Efficient hidden surface removal for objects with small union size
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00030-5openalex-snapshot
Space reduction and an extension for a hidden line elimination algorithm
inferred← citeshttps://doi.org/10.1016/1049-9652(92)90029-wopenalex-snapshot
A polygonal approach to hidden-line and hidden-surface elimination
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.10.004openalex-snapshot
Spiderman graph: Visibility in urban regions
inferred← citeshttps://doi.org/10.1016/s0734-189x(86)80028-7openalex-snapshot
On translating a set of objects in 2- and 3-dimensional space
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80114-7openalex-snapshot
New algorithms for special cases of the hidden line elimination problem
inferred← citeshttps://doi.org/10.1023/a:1009708413602openalex-snapshot
Visibility Computations on Hierarchical Triangulated Terrain Models
inferred← citeshttps://doi.org/10.1080/00207168508803482openalex-snapshot
A worst-case efficient algorithm for hidden-line elimination†
inferred← citeshttps://doi.org/10.1109/fscs.1990.89544openalex-snapshot
Hidden surface removal for axis-parallel polyhedra
inferred← citeshttps://doi.org/10.1109/iceeict.2014.6919150openalex-snapshot
An easier approach to visible edge determination from moving viewpoint
inferred← citeshttps://doi.org/10.1109/ipps.1998.669913openalex-snapshot
An improved output-size sensitive parallel algorithm for hidden-surface removal for terrains
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63541openalex-snapshot
Output-sensitive hidden surface removal
inferred← citeshttps://doi.org/10.1137/0220047openalex-snapshot
Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
inferred← citeshttps://doi.org/10.1145/102377.112141openalex-snapshot
A simple output-sensitive algorithm for hidden surface removal
inferred← citeshttps://doi.org/10.1145/10515.10544openalex-snapshot
Quadratic bounds for hidden line elimination
inferred← citeshttps://doi.org/10.1145/109648.109652openalex-snapshot
Efficient hidden surface removal for objects with small union size
inferred← citeshttps://doi.org/10.1145/27625.27627openalex-snapshot
Worst-case optimal hidden-surface removal
inferred← citeshttps://doi.org/10.1145/3452097openalex-snapshot
Vectorization for Fast, Analytic, and Differentiable Visibility
inferred← citeshttps://doi.org/10.1145/72935.72950openalex-snapshot
Intersecting line segments in parallel with an output-sensitive number of processors
inferred← citeshttps://doi.org/10.1145/73393.73413openalex-snapshot
An efficient output-sensitive hidden surface removal algorithm and its parallelization
inferred← citeshttps://doi.org/10.1145/78964.78967openalex-snapshot
Computation of the axial view of a set of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1145/97879.97890openalex-snapshot
Hidden curve removal for free form surfaces
inferred← citeshttps://doi.org/10.1145/97880.97890openalex-snapshot
Hidden curve removal for free form surfaces
inferred← citeshttps://doi.org/10.20380/gi1988.32openalex-snapshot
Theoretical results on the priority approach to hidden-surface removal
inferred← citeshttps://doi.org/10.22028/d291-25744openalex-snapshot
Interaktive Montageplanung mit Kollisionserkennung
inferred← citeshttps://doi.org/10.2312/eggh/eggh87/065-073openalex-snapshot
An O(log N) Parallel Time Exact Hidden-LineAlgorithm
inferred← citeshttps://doi.org/10.3929/ethz-a-006651848openalex-snapshot
Contour edge analysis for polyhedron projections
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.