On the public citation graph
On ray shooting in convex polytopes
0 signed · 103 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/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferredcites →https://doi.org/10.1007/bf01377182openalex-snapshot
Efficient ray shooting and hidden surface removal
inferredcites →https://doi.org/10.1007/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bf02574698openalex-snapshot
Euclidean minimum spanning trees and bichromatic closest pairs
inferredcites →https://doi.org/10.1007/bf02574699openalex-snapshot
Small-dimensional linear programming and convex hulls made easy
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/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
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(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferredcites →https://doi.org/10.1016/0925-7721(93)90024-zopenalex-snapshot
On vertical ray shooting in arrangements
inferredcites →https://doi.org/10.1016/0925-7721(94)90009-4openalex-snapshot
Point location among hyperplanes and unidirectional ray-shooting
inferredcites →https://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot
How to search in history
inferredcites →https://doi.org/10.1090/s0894-0347-1989-1001852-0openalex-snapshot
Lower Bounds on the Complexity of Polytope Range Searching
inferredcites →https://doi.org/10.1109/sfcs.1991.185371openalex-snapshot
Randomized multidimensional search trees: further results in dynamic sampling
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferredcites →https://doi.org/10.1145/109648.109662openalex-snapshot
Randomized multidimensional search trees (extended abstract)
inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferredcites →https://doi.org/10.1145/142675.142730openalex-snapshot
How hard is halfspace range searching?
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
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.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1007/11682462_44openalex-snapshot
Lower Bounds for Geometric Diameter Problems
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_44openalex-snapshot
Approximation Algorithms for the Bottleneck Stretch Factor Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_20openalex-snapshot
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions
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-642-15775-2_32openalex-snapshot
A Unified Approach to Approximate Proximity Searching
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_8openalex-snapshot
A Simple Framework for the Generalized Nearest Neighbor Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_7openalex-snapshot
Ray-Shooting Algorithms for Robotics
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_4openalex-snapshot
Computing the Hausdorff Distance of Geometric Patterns and Shapes
inferred← citeshttps://doi.org/10.1007/bf02712874openalex-snapshot
Output-sensitive results on convex hulls, extreme points, and related problems
inferred← citeshttps://doi.org/10.1007/bf02712875openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1007/pl00009327openalex-snapshot
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/pl00009390openalex-snapshot
Approximate Nearest Neighbor Queries Revisited
inferred← citeshttps://doi.org/10.1007/s00453-001-0096-5openalex-snapshot
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-007-9010-0openalex-snapshot
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope
inferred← citeshttps://doi.org/10.1007/s00454-010-9308-6openalex-snapshot
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting
inferred← citeshttps://doi.org/10.1007/s004540010086openalex-snapshot
An efficient algorithm for the three-dimensional diameter problem
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00019-0openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00012-7openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00021-6openalex-snapshot
Point location in zones of k-flats in arrangements
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00025-9openalex-snapshot
A deterministic algorithm for the three-dimensional diameter problem
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/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.110975openalex-snapshot
A fast method for obtaining convex combination coefficients
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.03.002openalex-snapshot
Extremal point queries with lines and line segments and related problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.02.004openalex-snapshot
Kinetic sorting and kinetic convex hulls
inferred← citeshttps://doi.org/10.1016/j.cviu.2020.102925openalex-snapshot
Efficient distance transformation for path-based metrics
inferred← citeshttps://doi.org/10.1016/j.jda.2013.03.008openalex-snapshot
All-maximum and all-minimum problems under some measures
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1109/fuzz-ieee55066.2022.9882729openalex-snapshot
Approximation of the Feasible Parameter Set in Bounded-Error Parameter Estimation of Takagi-Sugeno Fuzzy Models for Large Problems by Using a Ray Shooting Method
inferred← citeshttps://doi.org/10.1109/robot.2005.1570710openalex-snapshot
Iteratively Locating Voronoi Vertices for Dispersion Estimation
inferred← citeshttps://doi.org/10.1109/robot.2010.5509297openalex-snapshot
A fast n-dimensional ray-shooting algorithm for grasping force optimization
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548506openalex-snapshot
New lower bounds for halfspace emptiness
inferred← citeshttps://doi.org/10.1109/tase.2013.2272578openalex-snapshot
Ray-Shooting Algorithms for Robotics
inferred← citeshttps://doi.org/10.1137/070684483openalex-snapshot
Efficient Colored Orthogonal Range Counting
inferred← citeshttps://doi.org/10.1137/1.9781611973730.109openalex-snapshot
Optimal detection of intersections between convex polyhedra
inferred← citeshttps://doi.org/10.1137/1.9781611974782.18openalex-snapshot
Optimal Approximate Polytope Membership
inferred← citeshttps://doi.org/10.1137/16m1061096openalex-snapshot
Approximate Polytope Membership Queries
inferred← citeshttps://doi.org/10.1137/21m1408245openalex-snapshot
On Ray Shooting for Triangles in 3-Space and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539793253371openalex-snapshot
Star Unfolding of a Polytope with Applications
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1137/s0097539797315410openalex-snapshot
New Lower Bounds for Convex Hull Problems in Odd Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539798337212openalex-snapshot
Space-Time Tradeoffs for Emptiness Queries
inferred← citeshttps://doi.org/10.1142/s0218195902000748openalex-snapshot
APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
inferred← citeshttps://doi.org/10.1142/s0218195998000023openalex-snapshot
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
inferred← citeshttps://doi.org/10.1142/s0218195998000047openalex-snapshot
An Output-Sensitive Convex Hull Algorithm for Planar Objects
inferred← citeshttps://doi.org/10.1145/1064092.1064122openalex-snapshot
Kinetic sorting and kinetic convex hulls
inferred← citeshttps://doi.org/10.1145/1288869.1288884openalex-snapshot
A secure multidimensional point inclusion protocol
inferred← citeshttps://doi.org/10.1145/1706591.1706596openalex-snapshot
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
inferred← citeshttps://doi.org/10.1145/195058.195112openalex-snapshot
On point location and motion planning among simplices
inferred← citeshttps://doi.org/10.1145/1993636.1993713openalex-snapshot
Approximate polytope membership queries
inferred← citeshttps://doi.org/10.1145/220279.220281openalex-snapshot
Output-sensitive results on convex hulls, extreme points, and related problems
inferred← citeshttps://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/220279.220293openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/237218.237225openalex-snapshot
New lower bounds for convex hull problems in odd dimensions
inferred← citeshttps://doi.org/10.1145/237218.237397openalex-snapshot
Fixed-dimensional linear programming queries made easy
inferred← citeshttps://doi.org/10.1145/262839.262988openalex-snapshot
Space-time tradeoffs for emptiness queries (extended abstract)
inferred← citeshttps://doi.org/10.1145/262839.263001openalex-snapshot
Approximate nearest neighbor queries revisited
inferred← citeshttps://doi.org/10.1145/276884.276920openalex-snapshot
Efficiently approximating polygonal paths in three and higher dimensions
inferred← citeshttps://doi.org/10.1145/304893.304993openalex-snapshot
On range reporting, ray shooting and k -level construction
inferred← citeshttps://doi.org/10.1145/336154.336198openalex-snapshot
Linear programming queries revisited
inferred← citeshttps://doi.org/10.1145/336154.336216openalex-snapshot
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
inferred← citeshttps://doi.org/10.1145/997817.997854openalex-snapshot
Towards in-place geometric algorithms and data structures
inferred← citeshttps://doi.org/10.1201/9781315119335-67openalex-snapshot
Computational Geometry: Generalized (or Colored) Intersection Searching
inferred← citeshttps://doi.org/10.22215/etd/2016-11514openalex-snapshot
On Proximity Problems In Euclidean Spaces
inferred← citeshttps://doi.org/10.3390/app11199103openalex-snapshot
Manipulation Planning for Large Objects through Pivoting, Tumbling, and Regrasping
inferred← citeshttps://doi.org/10.5555/1109557.1109689openalex-snapshot
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
inferred← citeshttps://doi.org/10.5555/314613.314693openalex-snapshot
An efficient algorithm for the three-dimensional diameter problem
inferred← citeshttps://doi.org/10.6100/ir630204openalex-snapshot
New data structures and algorithms for mobile 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.