On the public citation graph

Applications of a new space-partitioning technique

0 signed · 119 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/3-540-54233-7_172openalex-snapshot

Ray shooting in polygons using geodesic triangulations

inferredcites →https://doi.org/10.1007/3-540-55488-2_30openalex-snapshot

On spanning trees with low crossing numbers

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

Data Structures and Algorithms 3

inferredcites →https://doi.org/10.1007/978-3-642-83539-1_42openalex-snapshot

Ray Tracing Algorithms — Theory and Practice

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

An improved technique for output-sensitive hidden surface removal

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

Efficient ray shooting and hidden surface removal

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

Storing line segments in partition trees

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

Implicitly representing arrangements of lines or segments

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

Quasi-optimal range searching in spaces of finite VC-dimension

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

Visibility and intersection problems in plane geometry

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

Combinatorial complexity bounds for arrangements of curves and spheres

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

Partitioning arrangements of lines I: An efficient deterministic algorithm

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

Partitioning arrangements of lines II: Applications

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

On the zone of a surface in a hyperplane arrangement

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

On the zone of a surface in a hyperplane arrangement

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

Determining the separation of preprocessed polyhedra — A unified approach

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

A singly-exponential stratification scheme for real semi-algebraic varieties and its applications

inferredcites →https://doi.org/10.1016/0020-0190(81)90093-4openalex-snapshot

Worst-case optimal insertion and deletion methods for decomposable searching problems

inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot

Maintenance of configurations in the plane

inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot

Decomposable searching problems I. Static-to-dynamic transformation

inferredcites →https://doi.org/10.1016/0196-6774(85)90007-0openalex-snapshot

A linear algorithm for determining the separation of convex polyhedra

inferredcites →https://doi.org/10.1016/0196-6774(87)90015-0openalex-snapshot

Space searching for intersecting objects

inferredcites →https://doi.org/10.1016/0304-3975(91)90261-yopenalex-snapshot

A singly exponential stratification scheme for real semi-algebraic varieties and its applications

inferredcites →https://doi.org/10.1016/0925-7721(91)90011-3openalex-snapshot

Merging visibility maps

inferredcites →https://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot

Visibility problems for polyhedral terrains

inferredcites →https://doi.org/10.1038/133967a0openalex-snapshot

Analytical Geometry of Three Dimensions

inferredcites →https://doi.org/10.1051/ita/1991250201031openalex-snapshot

Spanning trees with low crossing number

inferredcites →https://doi.org/10.1109/fscs.1990.89528openalex-snapshot

New results on dynamic planar point location

inferredcites →https://doi.org/10.1109/sfcs.1989.63541openalex-snapshot

Output-sensitive hidden surface removal

inferredcites →https://doi.org/10.1109/sfcs.1991.185345openalex-snapshot

An optimal convex hull algorithm and new results on cuttings

inferredcites →https://doi.org/10.1137/0221035openalex-snapshot

Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number

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.103470openalex-snapshot

Approximations and optimal geometric divide-and-conquer

inferredcites →https://doi.org/10.1145/109648.109649openalex-snapshot

Efficient partition trees

inferredcites →https://doi.org/10.1145/109648.109651openalex-snapshot

Efficient ray shooting and hidden surface removal

inferredcites →https://doi.org/10.1145/109648.109653openalex-snapshot

Intersection queries for curved objects (extended abstract)

inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot

Ray shooting and parametric search

inferredcites →https://doi.org/10.1145/142675.142732openalex-snapshot

Range searching with efficient hierarchical cuttings

inferredcites →https://doi.org/10.1145/73393.73397openalex-snapshot

Partition trees for triangle counting and other range searching problems

inferredcites →https://doi.org/10.1145/98524.98532openalex-snapshot

Quasi-optimal upper bounds for simplex range searching and new zone theorems

inferredcites →https://doi.org/10.5555/127787.127797openalex-snapshot

Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1996.0056openalex-snapshot

Ray Shooting Amidst Convex Polygons in 2D

inferred← citeshttps://doi.org/10.1007/11533719_55openalex-snapshot

Efficient Non-intersection Queries on Aggregated Geometric Data

inferred← citeshttps://doi.org/10.1007/3-540-55488-2_30openalex-snapshot

On spanning trees with low crossing numbers

inferred← citeshttps://doi.org/10.1007/3-540-57155-8_234openalex-snapshot

Connected component and simple polygon intersection searching

inferred← citeshttps://doi.org/10.1007/3-540-60392-1_18openalex-snapshot

Updating visibility information on multiresolut ion terrain models

inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_47openalex-snapshot

Efficient Algorithms for Geometric Shortest Path Query Problems

inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_10openalex-snapshot

Efficient Algorithms for Geometric Shortest Path Query Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_1openalex-snapshot

Simplex Range Searching and Its Variants: A Review

inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_57openalex-snapshot

Efficient View Point Selection for Silhouettes of Convex Polyhedra

inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_43openalex-snapshot

Ray Shooting and Stone Throwing

inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_45openalex-snapshot

On Computing the Centroid of the Vertices of an Arrangement and Related Problems

inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_65openalex-snapshot

Relative Convex Hulls in Semi-dynamic Subdivisions

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

Connected component and simple polygon intersection searching

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

How hard is half-space range searching?

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

On range searching with semialgebraic sets

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

Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions

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

Efficient Algorithms for Approximating Polygonal Chains

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

Determining the Castability of Simple Polyhedra

inferred← citeshttps://doi.org/10.1007/s00453-016-0268-yopenalex-snapshot

Spanners for Geodesic Graphs and Visibility Graphs

inferred← citeshttps://doi.org/10.1007/s00454-003-2924-7openalex-snapshot

Segment Intersection Searching Problems in General Settings

inferred← citeshttps://doi.org/10.1007/s00454-012-9410-zopenalex-snapshot

Optimal Partition Trees

inferred← citeshttps://doi.org/10.1007/s00454-012-9420-xopenalex-snapshot

An Incidence Theorem in Higher Dimensions

inferred← citeshttps://doi.org/10.1007/s00454-014-9625-2openalex-snapshot

A Faster Algorithm for Computing Motorcycle Graphs

inferred← citeshttps://doi.org/10.1007/s10898-009-9409-zopenalex-snapshot

A new asymmetric inclusion region for minimum weight triangulation

inferred← citeshttps://doi.org/10.1016/0020-0190(93)90025-5openalex-snapshot

The power of parallel projection

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/j.comgeo.2004.10.001openalex-snapshot

Ray shooting and stone throwing with near-linear storage

inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.04.001openalex-snapshot

Efficient view point selection for silhouettes of convex polyhedra

inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.01.004openalex-snapshot

Quickest path queries on transportation network

inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102196openalex-snapshot

Algorithms for computing closest points for segments

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.035openalex-snapshot

Visibility testing and counting for uncertain segments

inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00064-5openalex-snapshot

Iterated snap rounding

inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00016-8openalex-snapshot

On fat partitioning, fat covering and the union size of polygons

inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00027-2openalex-snapshot

3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

inferred← citeshttps://doi.org/10.1049/cp.2015.0606openalex-snapshot

A method for computing a sequence of circumscribing polygons and its analysis

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

Representing the visibility structure of a polyhedral terrain through a horizon map

inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot

Geometric range searching and its relatives

inferred← citeshttps://doi.org/10.1090/dimacs/006/05openalex-snapshot

Lines in space—A collection of results

inferred← citeshttps://doi.org/10.1109/2945.597797openalex-snapshot

The lazy sweep ray casting algorithm for rendering irregular grids

inferred← citeshttps://doi.org/10.1109/focs.2012.32openalex-snapshot

On Range Searching with Semialgebraic Sets II

inferred← citeshttps://doi.org/10.1109/pccga.1999.803349openalex-snapshot

Output sensitive extraction of silhouettes from polygonal geometry

inferred← citeshttps://doi.org/10.1109/sfcs.1992.267816openalex-snapshot

Dynamic half-space reporting, geometric optimization, and minimum spanning trees

inferred← citeshttps://doi.org/10.1109/svv.1996.558038openalex-snapshot

Fast rendering of irregular grids

inferred← citeshttps://doi.org/10.1137/0221035openalex-snapshot

Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number

inferred← citeshttps://doi.org/10.1137/0222051openalex-snapshot

Ray Shooting and Parametric Search

inferred← citeshttps://doi.org/10.1137/21m145118xopenalex-snapshot

Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments

inferred← citeshttps://doi.org/10.1137/s0097539791223747openalex-snapshot

Computing and Verifying Depth Orders

inferred← citeshttps://doi.org/10.1137/s0097539792224516openalex-snapshot

A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps

inferred← citeshttps://doi.org/10.1137/s0097539793244368openalex-snapshot

Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions

inferred← citeshttps://doi.org/10.1137/s0097539793252080openalex-snapshot

Ray Shooting Amidst Spheres in Three Dimensions and Related Problems

inferred← citeshttps://doi.org/10.1142/s0218195909003088openalex-snapshot

EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA

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

Efficient ray shooting and hidden surface removal

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/1542362.1542372openalex-snapshot

Shooting permanent rays among disjoint polygons in the plane

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

Determining the castability of simple polyhedra

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

Query-sensitive ray shooting

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

Optimal partition trees

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

Computational geometry

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

Geometric range searching

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

Approximating monotone polygonal curves using the uniform metric

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

A faster algorithm for computing motorcycle graphs

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

Average-case ray shooting and minimum weight triangulations

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

Raising roofs, crashing cycles, and playing pool

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

Efficient perspective-accurate silhouette computation and applications

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

Segment intersection searching problems in general settings

inferred← citeshttps://doi.org/10.1587/transfun.e96.a.1066openalex-snapshot

Reporting All Segment Intersections Using an Arbitrary Sized Work Space

inferred← citeshttps://doi.org/10.21236/ada228278openalex-snapshot

Implementation and Experimentation with Motion Planning Algorithms

inferred← citeshttps://doi.org/10.25781/kaust-yn9r1openalex-snapshot

Algorithms for Computing Motorcycle Graphs

inferred← citeshttps://doi.org/10.4230/lipics.socg.2015.186openalex-snapshot

Geometric Spanners for Points Inside a Polygonal Domain

inferred← citeshttps://doi.org/10.48550/arxiv.1303.5958openalex-snapshot

A Faster Algorithm for Computing Motorcycle Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.cs/9910017openalex-snapshot

Finite-resolution hidden surface removal

inferred← citeshttps://doi.org/10.52843/cassyni.nglyd8openalex-snapshot

Recent Developments on Intersection Searching

inferred← citeshttps://doi.org/10.5555/236226.236228openalex-snapshot

Fast rendering of irregular grids

inferred← citeshttps://doi.org/10.5555/313559.313764openalex-snapshot

Ray shooting amidst convex polytopes in three dimensions

inferred← citeshttps://doi.org/10.5555/313651.313710openalex-snapshot

On the all-pairs Euclidean short path problem

inferred← citeshttps://doi.org/10.5555/314161.314199openalex-snapshot

An efficient algorithm for terrain simplification

inferred← citeshttps://doi.org/10.5555/982792.982852openalex-snapshot

Output-sensitive construction of the union of triangles

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.