On the public citation graph
A dual approach to detect polyhedral intersections in arbitrary dimensions
0 signed · 36 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/bfb0046097openalex-snapshot
Efficient Structures for Geometric Data Management
inferredcites →https://doi.org/10.1016/0304-3975(79)90055-0openalex-snapshot
Finding the intersection of n half-spaces in time O(n log n)
inferredcites →https://doi.org/10.1016/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/7531.24036openalex-snapshot
Intersection of convex objects in two and three dimensions
inferredcites →https://doi.org/10.1145/800141.804662openalex-snapshot
Detection is easier than computation (Extended Abstract)
inferredcites →https://doi.org/10.2307/1573035openalex-snapshot
Principles of Interactive Computer Graphics
inferredcites →https://doi.org/10.2307/2283074openalex-snapshot
Linear Programming and Its Extensions.
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.1997.0908openalex-snapshot
Convex Minimization on a Grid and Applications
inferred← citeshttps://doi.org/10.1007/3-540-64574-8_395openalex-snapshot
Exact geometry and robot motion planning: Speculations on a few numerical experiments
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_28openalex-snapshot
Data Management in Environmental Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45081-8_6openalex-snapshot
Chapter 6: Access Methods and Query Processing Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-74571-3_19openalex-snapshot
The Implementation of the Cell Tree: Design Alternatives and Performance Evaluation
inferred← citeshttps://doi.org/10.1007/s10035-015-0593-xopenalex-snapshot
Discrete element simulations of direct shear tests with particle angularity effect
inferred← citeshttps://doi.org/10.1007/springerreference_62274openalex-snapshot
Indexing the Positions of Continuously Moving Objects
inferred← citeshttps://doi.org/10.1016/0010-4485(89)90070-5openalex-snapshot
Convex polyhedral chains: a representation for geometric data
inferred← citeshttps://doi.org/10.1016/j.partic.2015.02.007openalex-snapshot
Random packing of tetrahedral particles using the polyhedral discrete element method
inferred← citeshttps://doi.org/10.1038/s42254-023-00617-9openalex-snapshot
The role of particle shape in computational modelling of granular matter
inferred← citeshttps://doi.org/10.1109/69.91064openalex-snapshot
Tree-based access methods for spatial databases: implementation and performance evaluation
inferred← citeshttps://doi.org/10.1109/humanoids.2016.7803399openalex-snapshot
Stability polygons reshaping and morphing for smooth multi-contact transitions and force control of humanoid robots
inferred← citeshttps://doi.org/10.1109/icde.1989.47267openalex-snapshot
The design of the cell tree: an object-oriented index structure for geometric databases
inferred← citeshttps://doi.org/10.1109/robot.1997.619369openalex-snapshot
A practical motion planning strategy based on a plane-sweep approach
inferred← citeshttps://doi.org/10.1109/robot.2001.933207openalex-snapshot
Flexible exploitation of space coherence to detect collisions of convex polyhedra
inferred← citeshttps://doi.org/10.1145/263661.263689openalex-snapshot
Processing queries by linear constraints
inferred← citeshttps://doi.org/10.1145/335191.335427openalex-snapshot
Indexing the positions of continuously moving objects
inferred← citeshttps://doi.org/10.1145/342009.335427openalex-snapshot
Indexing the positions of continuously moving objects
inferred← citeshttps://doi.org/10.70675/d85735a7z2e8az422ezb915z926d9b346702openalex-snapshot
On multi-contact dynamic motion using reduced models
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.