On the public citation graph
Visibility with a moving point of view
0 signed · 67 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/bf00054919openalex-snapshot
Visibility, occlusion, and the aspect graph
inferredcites →https://doi.org/10.1007/bf02187806openalex-snapshot
Efficient binary space partitions for hidden-surface removal and solid modeling
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bf02579209openalex-snapshot
Almost linear upper bounds on the length of general davenport—schinzel sequences
inferredcites →https://doi.org/10.1007/bfb0040378openalex-snapshot
Optimal parallel evaluation of tree-structured computations by raking (extended abstract)
inferredcites →https://doi.org/10.1016/0020-0190(89)90136-1openalex-snapshot
Finding the upper envelope of n line segments in O(n log n) time
inferredcites →https://doi.org/10.1016/0022-0000(89)90034-2openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1016/0196-6774(89)90017-5openalex-snapshot
A simple parallel tree contraction algorithm
inferredcites →https://doi.org/10.1016/0898-1221(85)90105-1openalex-snapshot
Some dynamic computational geometry problems
inferredcites →https://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1109/sfcs.1988.21974openalex-snapshot
A fast planar partition algorithm. I
inferredcites →https://doi.org/10.1109/sfcs.1989.63540openalex-snapshot
On obstructions in relation to a fixed viewpoint
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0218056openalex-snapshot
Fully Dynamic Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1145/102377.112141openalex-snapshot
A simple output-sensitive algorithm for hidden surface removal
inferredcites →https://doi.org/10.1145/103418.103471openalex-snapshot
Hidden surface removal with respect to a moving view point
inferredcites →https://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1145/27625.27627openalex-snapshot
Worst-case optimal hidden-surface removal
inferredcites →https://doi.org/10.1145/356625.356626openalex-snapshot
A Characterization of Ten Hidden-Surface Algorithms
inferredcites →https://doi.org/10.1145/73393.73413openalex-snapshot
An efficient output-sensitive hidden surface removal algorithm and its parallelization
inferredcites →https://doi.org/10.1145/73393.73430openalex-snapshot
Skewed projections with an application to line stabbing in R3
inferredcites →https://doi.org/10.1145/73833.73836openalex-snapshot
Binary partitions with applications to hidden surface removal and solid modelling
inferredcites →https://doi.org/10.1145/800224.806788openalex-snapshot
Frame-to-frame coherence and the hidden surface computation
inferredcites →https://doi.org/10.1145/800250.807481openalex-snapshot
On visible surface generation by a priori tree structures
inferredcites →https://doi.org/10.1145/965105.807481openalex-snapshot
On visible surface generation by a priori tree structures
inferredcites →https://doi.org/10.1145/965161.806788openalex-snapshot
Frame-to-frame coherence and the hidden surface computation
inferredcites →https://doi.org/10.20380/gi1990.02openalex-snapshot
Real-time hidden-line elimination for a rotating polyhedral scene using the aspect representation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11751540_10openalex-snapshot
Computing Terrain Multi-visibility Maps for a Set of View Segments Using Graphics Hardware
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_14openalex-snapshot
On the Planar Two-Watchtower Problem
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_3openalex-snapshot
Digital elevation models and TIN algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-75175-5_13openalex-snapshot
New Results in Generation of Accurate 3D Multiview Representation of Monotonous Polyhedrons
inferred← citeshttps://doi.org/10.1007/978-3-540-75175-5_22openalex-snapshot
Spiral Scanning of Faces to Obtain Complete 3D View Representation of Monotonous Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_27openalex-snapshot
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/978-3-7091-6858-5_20openalex-snapshot
Hierarchical Visibility in Terrains
inferred← citeshttps://doi.org/10.1007/978-3-7091-7484-5_24openalex-snapshot
Hierarchical Back-Face Computation
inferred← citeshttps://doi.org/10.1007/bfb0030819openalex-snapshot
Three dimensional weak visibility: Complexity and applications
inferred← citeshttps://doi.org/10.1007/s00453-008-9220-0openalex-snapshot
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.12.003openalex-snapshot
On incremental rendering of silhouette maps of a polyhedral scene
inferred← citeshttps://doi.org/10.1016/j.jda.2009.10.002openalex-snapshot
Largest empty circle centered on a query line
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00211-1openalex-snapshot
Maintaining visibility of a polygon with a moving point of view
inferred← citeshttps://doi.org/10.1016/s0097-8493(99)00091-6openalex-snapshot
Hierarchical back-face computation
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00132-7openalex-snapshot
Three-dimensional weak visibility: Complexity and applications
inferred← citeshttps://doi.org/10.1017/9781009701259.020openalex-snapshot
On the Complexity of Visibility Problems with Moving Viewpoints
inferred← citeshttps://doi.org/10.1023/a:1007981819788openalex-snapshot
Convex Translation Estimation
inferred← citeshttps://doi.org/10.1080/00207169808804743openalex-snapshot
Visibility of rectagular objects inL1metric
inferred← citeshttps://doi.org/10.1080/13658810701300097openalex-snapshot
Multi‐visibility maps of triangulated terrains
inferred← citeshttps://doi.org/10.1090/dimacs/060/13openalex-snapshot
Visibility computations: From discrete algorithms to real algebraic geometry
inferred← citeshttps://doi.org/10.1109/2945.675656openalex-snapshot
Fast horizon computation at all points of a terrain with visibility and shading applications
inferred← citeshttps://doi.org/10.1109/34.615450openalex-snapshot
Toward accurate recovery of shape from shading under diffuse lighting
inferred← citeshttps://doi.org/10.1109/5.163408openalex-snapshot
Computational geometry and computer graphics
inferred← citeshttps://doi.org/10.1109/iccitechn.2010.5723878openalex-snapshot
Kinetisation of view of 3D point set
inferred← citeshttps://doi.org/10.1109/jcsse49651.2020.9268436openalex-snapshot
Building two communication towers over a terrain
inferred← citeshttps://doi.org/10.1137/1.9781611972887.4openalex-snapshot
Implementing Partial Persistence in Object-Oriented Languages
inferred← citeshttps://doi.org/10.1137/s0097539705447116openalex-snapshot
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
inferred← citeshttps://doi.org/10.1142/s0218195907002367openalex-snapshot
REGION INTERVISIBILITY IN TERRAINS
inferred← citeshttps://doi.org/10.1145/237218.237242openalex-snapshot
Temporally coherent conservative visibility (extended abstract)
inferred← citeshttps://doi.org/10.1145/262839.262847openalex-snapshot
Accelerated occlusion culling using shadow frusta
inferred← citeshttps://doi.org/10.2312/egt.20141024openalex-snapshot
Efficient Sorting and Searching in Rendering Algorithms
inferred← citeshttps://doi.org/10.5555/338219.338658openalex-snapshot
On incremental rendering of silhouette maps of polyhedral scene
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.