On the public citation graph

Trekking in the Alps Without Freezing or Getting Tired

https://doi.org/10.1007/pl00009159
0 signed · 79 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/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0925-7721(92)90024-mopenalex-snapshot
Efficient hidden surface removal for objects with small union size
inferredcites →https://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0215014openalex-snapshot
On Shortest Paths in Polyhedral Spaces
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot
Self-adjusting binary search trees
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/98524.98601openalex-snapshot
Shortest paths on a polyhedron
inferredcites →https://doi.org/10.5555/320176.320188openalex-snapshot
Visibility with a moving point of view

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/cviu.1996.0041openalex-snapshot
Image Analysis and Computer Vision: 1995
inferred← citeshttps://doi.org/10.1006/cviu.1998.0697openalex-snapshot
Image Analysis and Computer Vision: 1997
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-1-4471-2256-2_7openalex-snapshot
Paths on Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_23openalex-snapshot
Shortest Monotone Descent Path Problem in Polyhedral Terrain
inferred← citeshttps://doi.org/10.1007/978-3-540-33265-7_6openalex-snapshot
Morphological Representations of Scalar Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-88606-8_4openalex-snapshot
Topology Based Selection and Curation of Level Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_6openalex-snapshot
Shortest Gently Descending Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-15014-2_17openalex-snapshot
A Categorical Approach to Contour, Split and Join Trees with Application to Airway Segmentation
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_21openalex-snapshot
Computing the Fréchet Distance with a Retractable Leash
inferred← citeshttps://doi.org/10.1007/s00371-012-0714-zopenalex-snapshot
Non-rigid 3D object retrieval using topological information guided by conformal factors
inferred← citeshttps://doi.org/10.1007/s00453-003-1052-3openalex-snapshot
Parallel Computation of the Topology of Level Sets
inferred← citeshttps://doi.org/10.1007/s00454-016-9800-8openalex-snapshot
Computing the Fréchet Distance with a Retractable Leash
inferred← citeshttps://doi.org/10.1007/s40314-018-0686-3openalex-snapshot
Computing approximately shortest descending paths on convex terrains via multiple shooting
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/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/c2013-0-10333-9openalex-snapshot
Computer Aided Geometric Design
inferred← citeshttps://doi.org/10.1016/j.cag.2017.07.006openalex-snapshot
QCDVis: a tool for the visualisation of Quantum Chromodynamics (QCD) data
inferred← citeshttps://doi.org/10.1016/j.cagd.2012.03.019openalex-snapshot
Topology analysis of time-dependent multi-fluid data using the Reeb graph
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.05.002openalex-snapshot
Simple and optimal output-sensitive construction of contour trees using monotone paths
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.06.003openalex-snapshot
Shortest monotone descent path problem in polyhedral terrain
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.10.011openalex-snapshot
Shortest descending paths through given faces
inferred← citeshttps://doi.org/10.1016/j.jda.2009.05.001openalex-snapshot
Approximation algorithms for shortest descending paths in terrains
inferred← citeshttps://doi.org/10.1016/j.jda.2010.12.002openalex-snapshot
On the number of shortest descending paths on the surface of a convex terrain
inferred← citeshttps://doi.org/10.1016/j.jda.2012.03.001openalex-snapshot
Near optimal algorithm for the shortest descending path on the surface of a convex terrain
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.037openalex-snapshot
Optimal facility location problem on polyhedral terrains using descending paths
inferred← citeshttps://doi.org/10.1023/a:1009805426595openalex-snapshot
VARIANT: A System for Terrain Modeling at Variable Resolution
inferred← citeshttps://doi.org/10.1080/1365881031000072645openalex-snapshot
Research Article: Extensions to least-cost path algorithms for roadway planning
inferred← citeshttps://doi.org/10.1080/13658816.2017.1372764openalex-snapshot
A tile-based method for geodesic buffer generation in a virtual globe
inferred← citeshttps://doi.org/10.1109/hipc.2012.6507496openalex-snapshot
A hybrid parallel algorithm for computing and tracking level set topology
inferred← citeshttps://doi.org/10.1109/infocom.2008.149openalex-snapshot
Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks
inferred← citeshttps://doi.org/10.1109/iros.2017.8206019openalex-snapshot
Efficient sampling-based bottleneck pathfinding over cost maps
inferred← citeshttps://doi.org/10.1109/ldav.2017.8231846openalex-snapshot
Task-based augmented merge trees with Fibonacci heaps
inferred← citeshttps://doi.org/10.1109/pacificvis.2015.7156387openalex-snapshot
A parallel and memory efficient algorithm for constructing the contour tree
inferred← citeshttps://doi.org/10.1109/smi.2005.45openalex-snapshot
Subdomain aware contour trees and contour evolution in time-dependent scalar fields
inferred← citeshttps://doi.org/10.1109/tpds.2019.2898436openalex-snapshot
Task-Based Augmented Contour Trees with Fibonacci Heaps
inferred← citeshttps://doi.org/10.1109/tvcg.2009.163openalex-snapshot
Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees
inferred← citeshttps://doi.org/10.1109/tvcg.2019.2934257openalex-snapshot
Toward Localized Topological Data Structures: Querying the Forest for the Tree
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3060500openalex-snapshot
A Progressive Approach to Scalar Field Topology
inferred← citeshttps://doi.org/10.1109/visual.2002.1183774openalex-snapshot
Efficient computation of the topology of level sets
inferred← citeshttps://doi.org/10.1111/1467-8306.9303004openalex-snapshot
Representation and Spatial Analysis in Geographic Information Systems
inferred← citeshttps://doi.org/10.1111/1467-8659.00697openalex-snapshot
Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies
inferred← citeshttps://doi.org/10.1111/cgf.12109openalex-snapshot
Visualizing Robustness of Critical Points for 2D Time‐Varying Vector Fields
inferred← citeshttps://doi.org/10.1111/cgf.12933openalex-snapshot
A Survey of Topology‐based Methods in Visualization
inferred← citeshttps://doi.org/10.1111/cgf.13165openalex-snapshot
Computing Contour Trees for 2D Piecewise Polynomial Functions
inferred← citeshttps://doi.org/10.1111/cgf.70497openalex-snapshot
Scalable Computation of Topological Abstractions for Scalar Data
inferred← citeshttps://doi.org/10.1111/j.1467-8306.2004.09402005.xopenalex-snapshot
Tobler's First Law and Spatial Analysis
inferred← citeshttps://doi.org/10.1115/1.4025780openalex-snapshot
Monotone Descent Path Queries on Dynamic Terrains
inferred← citeshttps://doi.org/10.1137/130913808openalex-snapshot
Approximate Shortest Descending Paths
inferred← citeshttps://doi.org/10.1142/s0218195911003755openalex-snapshot
SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM
inferred← citeshttps://doi.org/10.1145/1391729.1391731openalex-snapshot
Describing shapes by geometrical-topological properties of real functions
inferred← citeshttps://doi.org/10.1145/2591796.2591821openalex-snapshot
Shortest paths on polyhedral surfaces and terrains
inferred← citeshttps://doi.org/10.1145/262839.269238openalex-snapshot
Contour trees and small seed sets for isosurface traversal
inferred← citeshttps://doi.org/10.1145/3154353.3154355openalex-snapshot
QCDVis
inferred← citeshttps://doi.org/10.1145/3274895.3274937openalex-snapshot
Volume-based similarity of linear features on terrains
inferred← citeshttps://doi.org/10.1145/3293353.3293384openalex-snapshot
On-Demand Augmentation of Contour Trees
inferred← citeshttps://doi.org/10.1145/383259.383282openalex-snapshot
Topology matching for fully automatic similarity estimation of 3D shapes
inferred← citeshttps://doi.org/10.1186/1471-2105-11-430openalex-snapshot
Coverage statistics for sequence census methods
inferred← citeshttps://doi.org/10.14288/1.0051283openalex-snapshot
Efficient generation of contour trees in three dimensions
inferred← citeshttps://doi.org/10.17169/refubium-19845openalex-snapshot
Lexicographic Fréchet matchings
inferred← citeshttps://doi.org/10.22215/etd/2024-16080openalex-snapshot
Shortest Path Problems in Weighted Regions
inferred← citeshttps://doi.org/10.3390/rs3010065openalex-snapshot
Automatic Registration of Airborne and Spaceborne Images by Topology Map Matching with SURF Processor Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.0705.1364openalex-snapshot
An Approximation Algorithm for Shortest Descending Paths
inferred← citeshttps://doi.org/10.48550/arxiv.1004.5587openalex-snapshot
Coverage statistics for sequence census methods
inferred← citeshttps://doi.org/10.5555/2627817.2627828openalex-snapshot
Approximate shortest descending paths
inferred← citeshttps://doi.org/10.5772/intechopen.82185openalex-snapshot
Topological Visualisation Techniques for Volume Multifield Data
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.