On the public citation graph
Determining the separation of preprocessed polyhedra — A unified approach
0 signed · 189 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/978-3-642-69900-9openalex-snapshot
Data Structures and Algorithms 3
inferredcites →https://doi.org/10.1007/bf01840397openalex-snapshot
Computational geometry in a curved world
inferredcites →https://doi.org/10.1007/bfb0012765openalex-snapshot
Fast detection of polyhedral intersections
inferredcites →https://doi.org/10.1007/bfb0028837openalex-snapshot
Intersecting two polyhedra one of which is convex
inferredcites →https://doi.org/10.1016/0020-0190(81)90051-xopenalex-snapshot
Finding the minimum distance between two convex polygons
inferredcites →https://doi.org/10.1016/0020-0190(85)90107-3openalex-snapshot
Finding extreme points in three dimensions and solving the post-office problem in the plane
inferredcites →https://doi.org/10.1016/0022-0000(89)90042-1openalex-snapshot
Parallel construction of subdivision hierarchies
inferredcites →https://doi.org/10.1016/0167-8396(91)90001-ropenalex-snapshot
Detecting the intersection of convex objects in the plane
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(85)90039-2openalex-snapshot
Computing the extreme distances between two convex polygons
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/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50007-4openalex-snapshot
Simple On-Line Algorithms for Convex Polygons
inferredcites →https://doi.org/10.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1109/sfcs.1989.63539openalex-snapshot
An optimal algorithm for intersecting three-dimensional convex polyhedra
inferredcites →https://doi.org/10.1109/tc.1983.1676186openalex-snapshot
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
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/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.1002/rob.8101openalex-snapshot
Computation of a penetration measure between 3D convex polyhedral objects for collision detection
inferred← citeshttps://doi.org/10.1006/jagm.1997.0914openalex-snapshot
Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_26openalex-snapshot
Hierarchy of Surface Models and Irreducible Triangulation
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_15openalex-snapshot
Counter-Example Guided Predicate Abstraction of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_29openalex-snapshot
Computing the Penetration Depth of Two Convex Polytopes in 3D
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_21openalex-snapshot
Separation Sensitive Kinetic Separation Structures for Convex Polygons
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_66openalex-snapshot
Implicitly searching convolutions and computing depth of collision
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_235openalex-snapshot
An optimal algorithm for finding the separation of simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_61openalex-snapshot
Computing common tangents without a separating line
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-3-031-79519-0openalex-snapshot
High Fidelity Haptic Rendering
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-642-00312-7_22openalex-snapshot
On Approximate Geodesic-Distance Queries amid Deforming Point Clouds
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_50openalex-snapshot
On the Computation of 3D Visibility Skeletons
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_9openalex-snapshot
Maximum Overlap of Convex Polytopes under Translation
inferred← citeshttps://doi.org/10.1007/978-3-642-23944-1_5openalex-snapshot
Facilitating 3D Spectroscopic Imaging through Automatic Prostate Localization in MR Images Using Random Walker Segmentation Initialized via Boosted Classifiers
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_61openalex-snapshot
Outlier Respecting Points Approximation
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_15openalex-snapshot
Succinct and Implicit Data Structures for Computational Geometry
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/978-94-017-1247-7_19openalex-snapshot
An Accurate Distance-Calculation Algorithm for Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/978-94-017-1247-7_31openalex-snapshot
SCAN-98 Collected Bibliography
inferred← citeshttps://doi.org/10.1007/bf01187036openalex-snapshot
Ray shooting on triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bf01190153openalex-snapshot
Computing the intersection-depth of polyhedra
inferred← citeshttps://doi.org/10.1007/bf01293667openalex-snapshot
A time-optimal parallel algorithm for three-dimensional convex hulls
inferred← citeshttps://doi.org/10.1007/bf01293668openalex-snapshot
Finding a closest visible vertex pair between two polygons
inferred← citeshttps://doi.org/10.1007/bf02189304openalex-snapshot
Applications of a new space-partitioning technique
inferred← citeshttps://doi.org/10.1007/bf02293052openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1007/bf02712873openalex-snapshot
Optimal output-sensitive convex hull algorithms in two and three dimensions
inferred← citeshttps://doi.org/10.1007/bfb0028246openalex-snapshot
Ray-shooting and isotopy classes of lines in 3-dimensional space
inferred← citeshttps://doi.org/10.1007/bfb0036075openalex-snapshot
Collision detection algorithms for motion planning
inferred← citeshttps://doi.org/10.1007/pl00009417openalex-snapshot
Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00371-004-0269-8openalex-snapshot
Collision detection with relative screw motion
inferred← citeshttps://doi.org/10.1007/s00371-006-0060-0openalex-snapshot
Interactive continuous collision detection for non-convex polyhedra
inferred← citeshttps://doi.org/10.1007/s003710050153openalex-snapshot
Polyhedron realization for shape transformation
inferred← citeshttps://doi.org/10.1007/s00453-008-9220-0openalex-snapshot
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/s00453-012-9738-zopenalex-snapshot
Outlier Respecting Points Approximation
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/s00454-016-9785-3openalex-snapshot
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-020-00229-5openalex-snapshot
Dynamic Geometric Data Structures via Shallow Cuttings
inferred← citeshttps://doi.org/10.1007/s00454-021-00358-5openalex-snapshot
On the Planar Two-Center Problem and Circular Hulls
inferred← citeshttps://doi.org/10.1007/s10589-010-9354-2openalex-snapshot
A local search algorithm for ray-convex polyhedron intersection
inferred← citeshttps://doi.org/10.1007/s10846-025-02266-9openalex-snapshot
A Team Orienteering Problem with Zoning for Safe and Flexible Operations of UAVs in a Dynamic Environment
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00006-uopenalex-snapshot
Separation and approximation of polyhedral objects
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50011-5openalex-snapshot
Geometric Data Structures
inferred← citeshttps://doi.org/10.1016/j.amc.2011.01.072openalex-snapshot
Representation complexity of adaptive 3D distance fields
inferred← citeshttps://doi.org/10.1016/j.cad.2007.05.017openalex-snapshot
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.07.001openalex-snapshot
Hierarchy of surface models and irreducible triangulations
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.01.001openalex-snapshot
Witness (Delaunay) graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.11.003openalex-snapshot
Maximum overlap of convex polytopes under translation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.01.002openalex-snapshot
Shape matching under rigid motion
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.02.001openalex-snapshot
Convex hulls of spheres and convex hulls of disjoint convex polytopes
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.01.010openalex-snapshot
Hausdorff approximation of 3D convex polytopes
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.026openalex-snapshot
Counterexample-guided predicate abstraction of hybrid systems
inferred← citeshttps://doi.org/10.1016/s0097-8493(00)00130-8openalex-snapshot
3D collision detection: a survey
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)85008-7openalex-snapshot
An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00100-1openalex-snapshot
Linear time approximation of 3D convex polytopes
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00009-0openalex-snapshot
Computing the shortest watchtower of a polyhedral terrain in O(nlogn) time
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00042-5openalex-snapshot
A hierarchical method for real-time distance computation among moving convex bodies
inferred← citeshttps://doi.org/10.1017/s0263574700019743openalex-snapshot
A fast algorithm for distance calculation between convex objects using the optimization approach
inferred← citeshttps://doi.org/10.1023/a:1009924204609openalex-snapshot
An Accurate Distance-Calculation Algorithm for Convex Polyhedra
inferred← citeshttps://doi.org/10.1023/a:1024755315702openalex-snapshot
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
inferred← citeshttps://doi.org/10.1023/a:1026231624387openalex-snapshot
A New Cell-subdivision Approach to Plan Free Translations in Cluttered Environments
inferred← citeshttps://doi.org/10.1088/1749-4699/1/1/015004openalex-snapshot
Deterministic point inclusion methods for computational applications with complex geometry
inferred← citeshttps://doi.org/10.1089/1066527042432279openalex-snapshot
Algorithm and Data Structures for Efficient Energy Maintenance during Monte Carlo Simulation of Proteins
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1109/2945.468401openalex-snapshot
Visualization of geometric algorithms
inferred← citeshttps://doi.org/10.1109/2945.675649openalex-snapshot
Efficient collision detection using bounding volume hierarchies of k-DOPs
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/70.544772openalex-snapshot
Growth distances: new measures for object separation and penetration
inferred← citeshttps://doi.org/10.1109/dagstuhl.1997.1423114openalex-snapshot
Fast and Accurate Collision Detection for Virtual Environments
inferred← citeshttps://doi.org/10.1109/focs.2007.10openalex-snapshot
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
inferred← citeshttps://doi.org/10.1109/focs.2007.9openalex-snapshot
Extractors and Rank Extractors for Polynomial Sources
inferred← citeshttps://doi.org/10.1109/iros.2000.895202openalex-snapshot
Fast convex minimization to detect collisions between polyhedra
inferred← citeshttps://doi.org/10.1109/iros.2000.895281openalex-snapshot
Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching
inferred← citeshttps://doi.org/10.1109/iscis.2009.5291854openalex-snapshot
Distance computation using OBB-trees
inferred← citeshttps://doi.org/10.1109/robot.1994.351234openalex-snapshot
Fast contact determination in dynamic environments
inferred← citeshttps://doi.org/10.1109/robot.1994.351327openalex-snapshot
Algorithms for rapid computation of some distance functions between objects for path planning
inferred← citeshttps://doi.org/10.1109/robot.1996.503867openalex-snapshot
Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects
inferred← citeshttps://doi.org/10.1109/robot.1996.506915openalex-snapshot
Speeding up interference detection between polyhedra
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.1998.681397openalex-snapshot
An incremental version of growth distance
inferred← citeshttps://doi.org/10.1109/robot.1998.681403openalex-snapshot
A framework for efficient minimum distance computations
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.1109/robot.2006.1642161openalex-snapshot
A performance comparison of three algorithms for proximity queries relative to convex polyhedra
inferred← citeshttps://doi.org/10.1109/robot.2007.363856openalex-snapshot
Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185410openalex-snapshot
Dynamic three-dimensional linear programming
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548506openalex-snapshot
New lower bounds for halfspace emptiness
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181981openalex-snapshot
Low-dimensional linear programming with violations
inferred← citeshttps://doi.org/10.1109/ssrr.2012.6523880openalex-snapshot
Hazardous workspace modeling for manipulators using spatial hazard functions
inferred← citeshttps://doi.org/10.1109/tnn.2006.881707openalex-snapshot
Efficient Optimal Linear Boosting of a Pair of Classifiers
inferred← citeshttps://doi.org/10.1109/tro.2007.895084openalex-snapshot
Incremental Convex Minimization for Computing Collision Translations of Convex Polyhedra
inferred← citeshttps://doi.org/10.1109/tvcg.2007.1016openalex-snapshot
Efficient collision detection within deforming spherical sliding contact
inferred← citeshttps://doi.org/10.1109/visual.1994.346325openalex-snapshot
GASP-a system for visualizing geometric algorithms
inferred← citeshttps://doi.org/10.1111/1467-8659.00543openalex-snapshot
Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
inferred← citeshttps://doi.org/10.1111/1467-8659.00653openalex-snapshot
Progressive Hulls for Intersection Applications
inferred← citeshttps://doi.org/10.1111/cgf.13113openalex-snapshot
kDet: Parallel Constant Time Collision Detection for Polygonal Objects
inferred← citeshttps://doi.org/10.1115/imece2005-79947openalex-snapshot
Non-Nominal Path Planning of Assembly Processes
inferred← citeshttps://doi.org/10.1137/0221031openalex-snapshot
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
inferred← citeshttps://doi.org/10.1137/1.9781611972863.1openalex-snapshot
Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
inferred← citeshttps://doi.org/10.1137/1.9781611973730.109openalex-snapshot
Optimal detection of intersections between convex polyhedra
inferred← citeshttps://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
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/s0097539798337212openalex-snapshot
Space-Time Tradeoffs for Emptiness Queries
inferred← citeshttps://doi.org/10.1142/s0218195907002367openalex-snapshot
REGION INTERVISIBILITY IN TERRAINS
inferred← citeshttps://doi.org/10.1142/s1793830910000899openalex-snapshot
A SUCCINCT 3D VISIBILITY SKELETON
inferred← citeshttps://doi.org/10.1145/109648.109663openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1145/1150334.1150338openalex-snapshot
Efficient algorithms for bichromatic separability
inferred← citeshttps://doi.org/10.1145/1185657.1185814openalex-snapshot
Exploiting perception in high-fidelity virtual environments
inferred← citeshttps://doi.org/10.1145/1198555.1198603openalex-snapshot
Introduction to haptic rendering
inferred← citeshttps://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferred← citeshttps://doi.org/10.1145/142675.142737openalex-snapshot
Intersection detection and separators for simple polygons
inferred← citeshttps://doi.org/10.1145/160985.161009openalex-snapshot
Tentative prune-and-search for computing Voronoi vertices
inferred← citeshttps://doi.org/10.1145/160985.161152openalex-snapshot
An NC parallel 3D convex hull algorithm
inferred← citeshttps://doi.org/10.1145/160985.161171openalex-snapshot
Building and using polyhedral hierarchies
inferred← citeshttps://doi.org/10.1145/1613676.1613678openalex-snapshot
On the union of fat tetrahedra in three 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.263003openalex-snapshot
Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions
inferred← citeshttps://doi.org/10.1145/263867.263869openalex-snapshot
Approximating shortest paths on a convex polytope in three dimensions
inferred← citeshttps://doi.org/10.1145/300523.300529openalex-snapshot
Fast collision detection using QuOSPO trees
inferred← citeshttps://doi.org/10.1145/304893.304976openalex-snapshot
Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons
inferred← citeshttps://doi.org/10.1145/336414.336423openalex-snapshot
Analyzing bounding boxes for object intersection
inferred← citeshttps://doi.org/10.1145/781606.781612openalex-snapshot
Collision prediction for polyhedra under screw motions
inferred← citeshttps://doi.org/10.1145/997817.997854openalex-snapshot
Towards in-place geometric algorithms and data structures
inferred← citeshttps://doi.org/10.1201/9781315119601-39openalex-snapshot
Collision and Proximity Queries
inferred← citeshttps://doi.org/10.14288/1.0051703openalex-snapshot
CInDeR : collision and interference detection in real time using graphics hardware
inferred← citeshttps://doi.org/10.1631/jzus.2006.a1522openalex-snapshot
A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
inferred← citeshttps://doi.org/10.21236/ada440300openalex-snapshot
Minimum Distance Queries for Polygonal and Parametric Models
inferred← citeshttps://doi.org/10.22028/d291-25744openalex-snapshot
Interaktive Montageplanung mit Kollisionserkennung
inferred← citeshttps://doi.org/10.22215/etd/2016-11514openalex-snapshot
On Proximity Problems In Euclidean Spaces
inferred← citeshttps://doi.org/10.2991/iccasm.2012.335openalex-snapshot
Judging the Intersection of Convex Polygons by Bracket Method
inferred← citeshttps://doi.org/10.3233/fi-1995-2243openalex-snapshot
TENTATIVE PRUNE-AND-SEARCH FOR COMPUTING FIXED-POINTS WITH APPLICATIONS TO GEOMETRIC COMPUTATION
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.30openalex-snapshot
Dynamic Distribution-Sensitive Point Location
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.68openalex-snapshot
On the Planar Two-Center Problem and Circular Hulls
inferred← citeshttps://doi.org/10.48550/arxiv.0906.3240openalex-snapshot
Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere
inferred← citeshttps://doi.org/10.48550/arxiv.1912.03429openalex-snapshot
Covering Polygons by Min-Area Convex Polygons
inferred← citeshttps://doi.org/10.4995/thesis/10251/56621openalex-snapshot
Modelado, detección de colisiones y planificación de movimientos en sistemas robotizados mediante volúmenes esféricos
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3360openalex-snapshot
A biomechanics-based articulation model for medical applications
inferred← citeshttps://doi.org/10.5194/isprsannals-ii-3-w5-25-2015openalex-snapshot
EVALUATING VOXEL ENABLED SCALABLE INTERSECTION OF LARGE POINT CLOUDS
inferred← citeshttps://doi.org/10.5555/1070432.1070556openalex-snapshot
On approximating the depth and related problems
inferred← citeshttps://doi.org/10.5555/313559.313764openalex-snapshot
Ray shooting amidst convex polytopes in three dimensions
inferred← citeshttps://doi.org/10.5555/314161.314345openalex-snapshot
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
inferred← citeshttps://doi.org/10.5555/314613.314692openalex-snapshot
Collision detection in aspect and scale bounded polyhedra
inferred← citeshttps://doi.org/10.5555/951087.951117openalex-snapshot
GASP-a system for visualizing geometric algorithms
inferred← citeshttps://doi.org/10.5555/982792.982897openalex-snapshot
Efficient algorithms for bichromatic separability
inferred← citeshttps://doi.org/10.70675/e0fc5095zb0ebz4e77z87ffz067b9ffde6c2openalex-snapshot
Evaluation d’un système de détection surfacique ‘Kinect V2’ dans différentes applications médicales
inferred← citeshttps://doi.org/10.7712/100016.2133.9025openalex-snapshot
NON-REGULAR VEHICLE DYNAMICS. APPLICATION TO COLLISION
inferred← citeshttps://doi.org/10.82308/31561openalex-snapshot
On the three-dimensional visibility skeleton: implementation and analysis
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.