On the public citation graph
A New Approach to Planar Point Location
0 signed · 122 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.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1016/0898-1221(78)90043-3openalex-snapshot
Combinatorial algorithms: Theory and practice
inferredcites →https://doi.org/10.1109/t-c.1973.223757openalex-snapshot
The Parallel Evaluation of Arithmetic Expressions Without Division
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1145/321958.321973openalex-snapshot
Restructuring of Arithmetic Expressions For Parallel Evaluation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/https://dx.doi.org/10.6028/nist.ir.7078openalex-snapshot
TIN Techniques for Data Analysis and Surface Construction
inferred← citeshttps://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferred← citeshttps://doi.org/10.1006/jagm.2000.1101openalex-snapshot
On the Exact Worst Case Query Complexity of Planar Point Location
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_1openalex-snapshot
The post-office problem and related questions
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_143openalex-snapshot
A dynamic data structure for planar graph embedding
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_26openalex-snapshot
Three-Dimensional Layers of Maxima
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_67openalex-snapshot
Planar point location revisited (A guided tour of a decade of research)
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_47openalex-snapshot
Combine and conquer: A general technique for dynamic algorithms
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_6openalex-snapshot
New results on binary space partitions in the plane (extended abstract)
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-642-33090-2_53openalex-snapshot
Improved Implementation of Point Location in General Two-Dimensional Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-642-84574-1_40openalex-snapshot
Geometric Data Structures for Computer Graphics
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_2openalex-snapshot
Adaptive Point Location in Planar Convex Subdivisions
inferred← citeshttps://doi.org/10.1007/bf01187021openalex-snapshot
A workbench for computational geometry
inferred← citeshttps://doi.org/10.1007/bf01758836openalex-snapshot
L 1 shortest paths among polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf02187806openalex-snapshot
Efficient binary space partitions for hidden-surface removal and solid modeling
inferred← citeshttps://doi.org/10.1007/bf02187877openalex-snapshot
Storing the subdivision of a polyhedral surface
inferred← citeshttps://doi.org/10.1007/bf02238357openalex-snapshot
A fast algorithm for point-location in a finite element mesh
inferred← citeshttps://doi.org/10.1007/bfb0028975openalex-snapshot
Dynamic planar point location with optimal query time
inferred← citeshttps://doi.org/10.1007/s00453-001-0027-5openalex-snapshot
Approximating Shortest Paths on Weighted Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-015-9677-yopenalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90066-8openalex-snapshot
Location of multiple points in a planar subdivision
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90090-4openalex-snapshot
Polygonal intersection searching
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90123-0openalex-snapshot
An improved algorithm for the fixed-radius neighbor problem
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90137-3openalex-snapshot
Parallel batched planar point location on the CCC
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90138-8openalex-snapshot
An incremental reconstruction method for dynamic planar point location
inferred← citeshttps://doi.org/10.1016/0031-3203(84)90064-5openalex-snapshot
An optimal algorithm for constructing the weighted voronoi diagram in the plane
inferred← citeshttps://doi.org/10.1016/0146-664x(82)90019-3openalex-snapshot
Determining the spatial containment of a point in general polyhedra
inferred← citeshttps://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
inferred← citeshttps://doi.org/10.1016/0196-6774(81)90008-0openalex-snapshot
Segments, rectangles, contours
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90027-6openalex-snapshot
Efficient uses of the past
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90030-6openalex-snapshot
Batched dynamic solutions to decomposable searching problems
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90004-0openalex-snapshot
Searching and storing similar lists
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90103-1openalex-snapshot
A space-optimal solution of general region location
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90007-5openalex-snapshot
Dynamic planar point location with optimal query time
inferred← citeshttps://doi.org/10.1016/0734-189x(83)90041-5openalex-snapshot
Performance analysis of cell based geometric file organizations
inferred← citeshttps://doi.org/10.1016/0734-189x(84)90142-7openalex-snapshot
Some methods of computational geometry applied to computer graphics
inferred← citeshttps://doi.org/10.1016/0734-189x(84)90193-2openalex-snapshot
Some methods of computational geometry applied to computer graphics
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50008-6openalex-snapshot
On Geometric Algorithms that use the Furthest-Point Voronoi Diagram
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50011-6openalex-snapshot
Practical use of Bucketing Techniques in Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50011-5openalex-snapshot
Geometric Data Structures
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.02.005openalex-snapshot
Query point visibility computation in polygons with holes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.005openalex-snapshot
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.10.003openalex-snapshot
Offset polygon and annulus placement problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.07.006openalex-snapshot
Optimal randomized incremental construction for guaranteed logarithmic planar point location
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80040-6openalex-snapshot
Geometric retrieval problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00070-0openalex-snapshot
Efficient visibility queries in simple polygons
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00008-4openalex-snapshot
New results on binary space partitions in the plane
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00025-xopenalex-snapshot
Offset-polygon annulus placement problems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)59974-7openalex-snapshot
Locus Techniques for Shortest Path Problems in Robotics
inferred← citeshttps://doi.org/10.1017/9781009701259.030openalex-snapshot
Binary Space Partitions: Recent Developments
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/3468.686708openalex-snapshot
Two algorithms for a reachability problem in one-dimensional space
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/cgi.1996.511793openalex-snapshot
Three major extensions to Kirkpatrick's point location algorithm
inferred← citeshttps://doi.org/10.1109/dac.1982.1585522openalex-snapshot
The EXCELL Method for Efficient Geometric Access to Data
inferred← citeshttps://doi.org/10.1109/jra.1987.1087092openalex-snapshot
Minimizing turns for discrete movement in the interior of a polygon
inferred← citeshttps://doi.org/10.1109/sfcs.1979.47openalex-snapshot
Transforming static data structures to dynamic structures
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21972openalex-snapshot
Fully dynamic techniques for point location and transitive closure in planar structures
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892108openalex-snapshot
Nearly optimal expected-case planar point location
inferred← citeshttps://doi.org/10.1109/tc.1980.1675628openalex-snapshot
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
inferred← citeshttps://doi.org/10.1109/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1109/tc.1984.1676494openalex-snapshot
Computational Geometry on a Systolic Chip
inferred← citeshttps://doi.org/10.1109/tit.1985.1057060openalex-snapshot
On the convex layers of a planar set
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22472.xopenalex-snapshot
Planar Point Location Using Persistent Search Treesa
inferred← citeshttps://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferred← citeshttps://doi.org/10.1137/0213031openalex-snapshot
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
inferred← citeshttps://doi.org/10.1137/0214034openalex-snapshot
Intersection and Closest-Pair Problems for a Set of Planar Discs
inferred← citeshttps://doi.org/10.1137/0214046openalex-snapshot
An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem
inferred← citeshttps://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferred← citeshttps://doi.org/10.1137/0218056openalex-snapshot
Fully Dynamic Point Location in a Monotone Subdivision
inferred← citeshttps://doi.org/10.1137/0220060openalex-snapshot
Minimum Diameter Spanning Trees and Related Problems
inferred← citeshttps://doi.org/10.1137/0221057openalex-snapshot
New Results on Dynamic Planar Point Location
inferred← citeshttps://doi.org/10.1137/s0097539704446724openalex-snapshot
Optimal Expected-Case Planar Point Location
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/s0097539793254376openalex-snapshot
Dynamic Trees and Dynamic Point Location
inferred← citeshttps://doi.org/10.1137/s0097539793256880openalex-snapshot
On Point Location and Motion Planning among Simplices
inferred← citeshttps://doi.org/10.1137/s0097539796305365openalex-snapshot
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
inferred← citeshttps://doi.org/10.1142/s0218195901000390openalex-snapshot
A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
inferred← citeshttps://doi.org/10.1142/s0218195917600019openalex-snapshot
Adaptive Point Location in Planar Convex Subdivisions
inferred← citeshttps://doi.org/10.1142/s0218195992000184openalex-snapshot
DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
inferred← citeshttps://doi.org/10.1142/s0218195996000095openalex-snapshot
SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
inferred← citeshttps://doi.org/10.1145/103418.103472openalex-snapshot
Dynamic trees and dynamic point location
inferred← citeshttps://doi.org/10.1145/10515.10532openalex-snapshot
Storing the subdivision of a polyhedral surface
inferred← citeshttps://doi.org/10.1145/1064092.1064140openalex-snapshot
Efficient computation of query point visibility in polygons with holes
inferred← citeshttps://doi.org/10.1145/109648.109655openalex-snapshot
Dynamization of the trapezoid method for planar point location (extended abstract)
inferred← citeshttps://doi.org/10.1145/1412228.1412237openalex-snapshot
An experimental study of point location in planar arrangements in CGAL
inferred← citeshttps://doi.org/10.1145/1542362.1542376openalex-snapshot
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
inferred← citeshttps://doi.org/10.1145/2229163.2229173openalex-snapshot
Entropy, triangulation, and point location in planar subdivisions
inferred← citeshttps://doi.org/10.1145/2582112.2582166openalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1145/336154.336206openalex-snapshot
Linear-time triangulation of a simple polygon made easier via randomization
inferred← citeshttps://doi.org/10.1145/357337.357338openalex-snapshot
A new point-location algorithm and its practical efficiency: comparison with existing algorithms
inferred← citeshttps://doi.org/10.1145/378583.378647openalex-snapshot
A segment-tree based kinetic BSP
inferred← citeshttps://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferred← citeshttps://doi.org/10.1145/73833.73864openalex-snapshot
Bounded diameter minimum spanning trees and related problems
inferred← citeshttps://doi.org/10.14711/thesis-b777639openalex-snapshot
Expected-case planar point location
inferred← citeshttps://doi.org/10.21236/ada123362openalex-snapshot
Computational Geometry on a Systolic Chip
inferred← citeshttps://doi.org/10.21236/ada201173openalex-snapshot
Dynamic Data Structures for Two-Dimensional Searching
inferred← citeshttps://doi.org/10.2514/5.9781600866180.0175.0204openalex-snapshot
Fast Projection Algorithm for Unstructured Meshes
inferred← citeshttps://doi.org/10.48550/arxiv.0909.2891openalex-snapshot
Going Off-road: Transversal Complexity in Road Networks
inferred← citeshttps://doi.org/10.5555/313559.313610openalex-snapshot
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
inferred← citeshttps://doi.org/10.5555/314161.314438openalex-snapshot
Methods for achieving fast query times in point location data structures
inferred← citeshttps://doi.org/10.5555/314613.315025openalex-snapshot
On the exact worst case query complexity of planar point location
inferred← citeshttps://doi.org/10.5555/320176.320189openalex-snapshot
Applying parallel processing techniques to classification problems in constructive solid geometry
inferred← citeshttps://doi.org/10.5555/800263.809228openalex-snapshot
The EXCELL Method for Efficient Geometric Access to Data
inferred← citeshttps://doi.org/10.6028/nist.ir.7078openalex-snapshot
TIN techniques for data analysis and surface construction
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.