On the public citation graph

On the number of views of polyhedral terrains

https://doi.org/10.1007/bf02574373
0 signed · 27 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.1002/ima.1850020407openalex-snapshot
Aspect graphs: An introduction and survey of recent results
inferredcites →https://doi.org/10.1007/bf00054919openalex-snapshot
Visibility, occlusion, and the aspect graph
inferredcites →https://doi.org/10.1007/bf00365595openalex-snapshot
The singularities of the visual mapping
inferredcites →https://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferredcites →https://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferredcites →https://doi.org/10.1109/34.87341openalex-snapshot
Efficiently computing and representing aspect graphs of polyhedral objects
inferredcites →https://doi.org/10.1109/sfcs.1986.4openalex-snapshot
An algorithm for constructing the aspect graph
inferredcites →https://doi.org/10.1109/sfcs.1993.366837openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferredcites →https://doi.org/10.1117/12.933609openalex-snapshot
Characteristic Views As A Basis For Three-Dimensional Object Recognition
inferredcites →https://doi.org/10.1145/160985.160989openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains

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_3openalex-snapshot
Visibility Maps of Segments and Triangles in 3D
inferred← citeshttps://doi.org/10.1007/3-540-44438-6_30openalex-snapshot
A New Visibility Partition for Affine Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_1openalex-snapshot
Recent Developments in the Theory of Arrangements of Surfaces
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_55openalex-snapshot
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
inferred← citeshttps://doi.org/10.1007/bf02574383openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferred← citeshttps://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1007/bf02716576openalex-snapshot
The overlay of lower envelopes and its applications
inferred← citeshttps://doi.org/10.1007/pl00009383openalex-snapshot
Notes on the complexity of exact view graph algorithms for piecewise smooth Algebraic Surfaces
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.10.001openalex-snapshot
On the number of views of translates of a cube and related problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.11.001openalex-snapshot
Visibility maps of segments and triangles in 3D
inferred← citeshttps://doi.org/10.1016/s0020-0255(97)00018-2openalex-snapshot
Visibility of “tame” terrain
inferred← citeshttps://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with Applications
inferred← citeshttps://doi.org/10.1142/s0218195905001841openalex-snapshot
COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
inferred← citeshttps://doi.org/10.1142/s0218195907002367openalex-snapshot
REGION INTERVISIBILITY IN TERRAINS
inferred← citeshttps://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
inferred← citeshttps://doi.org/10.14288/1.0051704openalex-snapshot
All the distant horizon edges of a terrain
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.