On the public citation graph
Small-dimensional linear programming and convex hulls made easy
0 signed · 234 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/bf01587088openalex-snapshot
A randomized algorithm for fixed-dimensional linear programming
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1016/0020-0190(86)90037-2openalex-snapshot
Linear programming in O(n × 3d) time
inferredcites →https://doi.org/10.1016/0196-6774(85)90017-3openalex-snapshot
Finding the convex hull facet by facet
inferredcites →https://doi.org/10.1109/sfcs.1982.74openalex-snapshot
Linear-time algorithms for linear programming in R3 and related problems
inferredcites →https://doi.org/10.1112/s0025579300002850openalex-snapshot
The maximum numbers of faces of a convex polytope
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
inferredcites →https://doi.org/10.1137/0215052openalex-snapshot
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
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/321556.321564openalex-snapshot
An Algorithm for Convex Polytopes
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/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.14288/1.0051821openalex-snapshot
A convex hull algorithm optimal for point sets in even dimensions
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/rsa.3240050408openalex-snapshot
Lower bounds for a subexponential optimization algorithm
inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1006/jagm.1996.0060openalex-snapshot
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
inferred← citeshttps://doi.org/10.1006/jagm.1996.0849openalex-snapshot
Choosing Subsets with Maximum Weighted Average
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/11496915_16openalex-snapshot
Unique Sink Orientations of Grids
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_3openalex-snapshot
Irregularities of Distribution, Derandomization, and Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-45506-x_3openalex-snapshot
Explicit and Implicit Enforcing - Randomized Optimization
inferred← citeshttps://doi.org/10.1007/3-540-45986-3_33openalex-snapshot
An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem
inferred← citeshttps://doi.org/10.1007/3-540-45986-3_34openalex-snapshot
Reconstruction of Animated Models from Images Using Constrained Deformable Surfaces
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_43openalex-snapshot
In-Place Planar Convex Hull Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_44openalex-snapshot
The Level Ancestor Problem Simplified
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_213openalex-snapshot
A combinatorial bound for linear programming and related problems
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_105openalex-snapshot
Enumerating extreme points in higher dimensions
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_149openalex-snapshot
Geometric pattern matching in d-dimensional space
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_54openalex-snapshot
Linear programming — Randomization and abstract frameworks
inferred← citeshttps://doi.org/10.1007/978-1-4419-0999-2_3openalex-snapshot
Some Discrete Properties of the Space of Line Transversals to Disjoint Balls
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_7openalex-snapshot
Parallel Randomized Techniques for Some Fundamental Geometric Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-22514-8_22openalex-snapshot
Fast Simulation of Crowd Collision Avoidance
inferred← citeshttps://doi.org/10.1007/978-3-0346-0425-3_7openalex-snapshot
Combinatorics with a Geometric Flavor
inferred← citeshttps://doi.org/10.1007/978-3-0348-8438-9_6openalex-snapshot
Exact Volume Computation for Polytopes: A Practical Study
inferred← citeshttps://doi.org/10.1007/978-3-319-45378-1_22openalex-snapshot
Optimal Ellipse Based Algorithm as an Approximate and Robust Solution of Minimum Volume Covering Ellipse Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-54427-4_12openalex-snapshot
An Efficient Meta-Algorithm for Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_30openalex-snapshot
Superimposing Voronoi Complexes for Shape Deformation
inferred← citeshttps://doi.org/10.1007/978-3-642-02982-0_17openalex-snapshot
Spatial Skyline Queries: An Efficient Geometric Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-19867-0_20openalex-snapshot
Analytical Description of Digital Circles
inferred← citeshttps://doi.org/10.1007/978-3-642-58409-1_10openalex-snapshot
Towards a Unified Framework for Randomized Pivoting Algorithms in Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-658-37711-3_4openalex-snapshot
Durchschnitte, Zerlegungen und Sichtbarkeit
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_3openalex-snapshot
An Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-61983-4openalex-snapshot
Transactions on Computational Science XXXVII
inferred← citeshttps://doi.org/10.1007/978-3-662-61983-4_8openalex-snapshot
Simulating Crowds and Autonomous Vehicles
inferred← citeshttps://doi.org/10.1007/978-4-431-68456-5_25openalex-snapshot
A Methodology for Geometric Algorithm Development
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_17openalex-snapshot
On the Complexity of Some Basic Problems in Computational Convexity
inferred← citeshttps://doi.org/10.1007/978-981-92-2888-1_34openalex-snapshot
Shape-Aware Compression of Streaming Data: An Online Dynamic Polynomial Selection Approach
inferred← citeshttps://doi.org/10.1007/978-981-96-0579-8_10openalex-snapshot
Representation with Minimized Max-Error in Optimal Piecewise Linear Approximation of Time Series Data
inferred← citeshttps://doi.org/10.1007/bf01185230openalex-snapshot
Randomized algorithms for the separation of point sets and for solving quadratic programs
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/bf01940875openalex-snapshot
Randomized geometric algorithms and pseudorandom generators
inferred← citeshttps://doi.org/10.1007/bf01940877openalex-snapshot
A subexponential bound for linear programming
inferred← citeshttps://doi.org/10.1007/bf02192641openalex-snapshot
General models in min-max planar location: Checking optimality conditions
inferred← citeshttps://doi.org/10.1007/bf02570705openalex-snapshot
On lazy randomized incremental construction
inferred← citeshttps://doi.org/10.1007/bf02570717openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1007/bf02573975openalex-snapshot
On ray shooting in convex polytopes
inferred← citeshttps://doi.org/10.1007/bf02573985openalex-snapshot
An optimal convex hull algorithm in any fixed dimension
inferred← citeshttps://doi.org/10.1007/bf02614318openalex-snapshot
Linear programming, the simplex algorithm and simple polytopes
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/bf02770866openalex-snapshot
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/bfb0054365openalex-snapshot
Two-variable linear programming in parallel
inferred← citeshttps://doi.org/10.1007/pl00009325openalex-snapshot
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
inferred← citeshttps://doi.org/10.1007/pl00014422openalex-snapshot
Determining the Castability of Simple Polyhedra
inferred← citeshttps://doi.org/10.1007/s00453-007-9090-xopenalex-snapshot
Unique Sink Orientations of Grids
inferred← citeshttps://doi.org/10.1007/s00454-001-0006-2openalex-snapshot
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization
inferred← citeshttps://doi.org/10.1007/s00454-006-1257-8openalex-snapshot
Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm
inferred← citeshttps://doi.org/10.1007/s00454-006-1275-6openalex-snapshot
Multi-Pass Geometric Algorithms
inferred← citeshttps://doi.org/10.1007/s00454-009-9170-6openalex-snapshot
Markov Incremental Constructions
inferred← citeshttps://doi.org/10.1007/s00454-020-00193-0openalex-snapshot
Random Sampling with Removal
inferred← citeshttps://doi.org/10.1007/s00778-014-0368-8openalex-snapshot
A time-series compression technique and its application to the smart grid
inferred← citeshttps://doi.org/10.1007/s00778-024-00840-5openalex-snapshot
Time series data encoding in Apache IoTDB: comparative analysis and recommendation
inferred← citeshttps://doi.org/10.1007/s10115-017-1063-zopenalex-snapshot
Linear separability in spatial databases
inferred← citeshttps://doi.org/10.1007/s10479-014-1707-2openalex-snapshot
A characterization theorem and an algorithm for a convex hull problem
inferred← citeshttps://doi.org/10.1007/s10707-010-0119-yopenalex-snapshot
Spatial skyline queries: exact and approximation algorithms
inferred← citeshttps://doi.org/10.1007/s11042-018-6185-0openalex-snapshot
A fast convex hull algorithm inspired by human visual perception
inferred← citeshttps://doi.org/10.1007/s11222-008-9054-2openalex-snapshot
Output-sensitive algorithms for Tukey depth and related problems
inferred← citeshttps://doi.org/10.1007/s13235-018-0259-5openalex-snapshot
Generation of Dangerous Disturbances for Flight Systems
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00009-3openalex-snapshot
Complexity of projected images of convex subdivisions
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00018-6openalex-snapshot
Average case analysis of dynamic geometric optimization
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)00024-0openalex-snapshot
An algorithm for constructing the convex hull of a set of spheres in dimension d
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50023-7openalex-snapshot
Mathematical Programming and Convex Geometry
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
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/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50017-6openalex-snapshot
Randomized Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.cad.2004.09.007openalex-snapshot
Approximating centroids for the maximum intersection of spherical polygons
inferred← citeshttps://doi.org/10.1016/j.cag.2016.01.003openalex-snapshot
Parallel computation of optimal enclosing balls by iterative orthant scan
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2010.12.003openalex-snapshot
Reducing PAPR by selecting optimal wavelet tree structure in WOFDM
inferred← citeshttps://doi.org/10.1016/j.compgeo.2012.03.012openalex-snapshot
A new algorithm for contact detection between convex polygonal and polyhedral particles in the discrete element method
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112403openalex-snapshot
Stabbing pairwise intersecting disks by five points
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.08.001openalex-snapshot
Prune-and-search with limited workspace
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.01.001openalex-snapshot
Two-dimensional batch linear programming on the GPU
inferred← citeshttps://doi.org/10.1016/j.jsc.2003.08.006openalex-snapshot
Convex hulls, oracles, and homology
inferred← citeshttps://doi.org/10.1016/j.patcog.2009.06.014openalex-snapshot
Measure of circularity for parts of digital boundaries and its fast computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.05.004openalex-snapshot
Space-efficient planar convex hull algorithms
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00028-1openalex-snapshot
Two-variable linear programming in parallel
inferred← citeshttps://doi.org/10.1016/s1524-0703(03)00008-0openalex-snapshot
A linear incremental algorithm for naive and standard digital lines and planes recognition
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80337-8openalex-snapshot
On a Simple Sampling Lemma
inferred← citeshttps://doi.org/10.1080/01495730008947354openalex-snapshot
A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
inferred← citeshttps://doi.org/10.1080/10637199508915495openalex-snapshot
A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗
inferred← citeshttps://doi.org/10.1090/bull/1653openalex-snapshot
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
inferred← citeshttps://doi.org/10.1090/conm/685/13718openalex-snapshot
Helly’s theorem: New variations and applications
inferred← citeshttps://doi.org/10.1109/cdc.2006.377631openalex-snapshot
Real Time Feedback Control for Nonholonomic Mobile Robots With Obstacles
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263961openalex-snapshot
Partitioning of the free space-time for on-road navigation of autonomous ground vehicles
inferred← citeshttps://doi.org/10.1109/cdc56724.2024.10886505openalex-snapshot
Estimation of Constraint Admissible Invariant Set with Neural Lyapunov Function
inferred← citeshttps://doi.org/10.1109/coase.2017.8256076openalex-snapshot
On the separation of a polyhedron from its single-part mold
inferred← citeshttps://doi.org/10.1109/focs.2004.47openalex-snapshot
On the Power of Discrete and of Lexicographic Helly-Type Theorems
inferred← citeshttps://doi.org/10.1109/icassp.2004.1326325openalex-snapshot
Efficient (piecewise) linear minmax approximation of digital signals
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00351openalex-snapshot
QSRP: Efficient Reverse $k-\text{Ranks}$ Query Processing on High-Dimensional Embeddings
inferred← citeshttps://doi.org/10.1109/icip.2004.1421792openalex-snapshot
l∞ norm based second generation image coding
inferred← citeshttps://doi.org/10.1109/icmlc.2008.4620433openalex-snapshot
A new algorithm for solving convex hull problem and its application to feature selection
inferred← citeshttps://doi.org/10.1109/icra.2019.8794081openalex-snapshot
Critically fast pick-and-place with suction cups
inferred← citeshttps://doi.org/10.1109/icra48891.2023.10160516openalex-snapshot
A Linear and Exact Algorithm for Whole-Body Collision Evaluation via Scale Optimization
inferred← citeshttps://doi.org/10.1109/icus66297.2025.11294189openalex-snapshot
Multi-Objective Optimal Control Allocation for Tilt-Rotor UAVs under Uncertain Conditions
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00081openalex-snapshot
CPRIC: Collaborative Parallelism for Randomized Incremental Constructions
inferred← citeshttps://doi.org/10.1109/lra.2021.3068660openalex-snapshot
Reactive Navigation in Crowds for Non-Holonomic Robots With Convex Bounding Shape
inferred← citeshttps://doi.org/10.1109/lra.2022.3231827openalex-snapshot
CPA-Planner: Motion Planner With Complete Perception Awareness for Sensing- Limited Quadrotors
inferred← citeshttps://doi.org/10.1109/robot.2005.1570710openalex-snapshot
Iteratively Locating Voronoi Vertices for Dispersion Estimation
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267805openalex-snapshot
A subexponential algorithm for abstract optimization problems
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267815openalex-snapshot
Randomized geometric algorithms and pseudo-random generators
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365724openalex-snapshot
Parallel algorithms for higher-dimensional convex hulls
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/tac.2023.3292980openalex-snapshot
A Computational Governor for Maintaining Feasibility and Low Computational Cost in Model Predictive Control
inferred← citeshttps://doi.org/10.1109/tmech.2025.3541148openalex-snapshot
Distributed Pursuit of an Evader With Perception and Localization Uncertainty for Autonomous Aerial Vehicles in Obstacle Environments
inferred← citeshttps://doi.org/10.1109/tpami.2017.2750672openalex-snapshot
Coresets for Triangulation
inferred← citeshttps://doi.org/10.1109/tro.2022.3160022openalex-snapshot
Geometrically Constrained Trajectory Optimization for Multicopters
inferred← citeshttps://doi.org/10.1109/tro.2025.3562482openalex-snapshot
Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space
inferred← citeshttps://doi.org/10.1109/tro.2025.3573667openalex-snapshot
Primitive-Swarm: An Ultra-Lightweight and Scalable Planner for Large-Scale Aerial Swarms
inferred← citeshttps://doi.org/10.1109/tsp.2006.875394openalex-snapshot
Approximations of One-Dimensional Digital Signals Under the$l^infty$Norm
inferred← citeshttps://doi.org/10.1109/twc.2023.3313820openalex-snapshot
1-bit Massive MIMO Signal Detector Based on Convex Integral Quadratic Programming
inferred← citeshttps://doi.org/10.1111/1467-8659.00653openalex-snapshot
Progressive Hulls for Intersection Applications
inferred← citeshttps://doi.org/10.1111/cgf.15137openalex-snapshot
KerGen: A Kernel Computation Algorithm for 3D Polygon Meshes
inferred← citeshttps://doi.org/10.1111/cgf.70187openalex-snapshot
Exact and Efficient Mesh‐Kernel Generation
inferred← citeshttps://doi.org/10.1111/cgf.70379openalex-snapshot
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
inferred← citeshttps://doi.org/10.1111/cgf.70518openalex-snapshot
Progressive Convex Hull Simplification
inferred← citeshttps://doi.org/10.1137/0222077openalex-snapshot
Computing a Face in an Arrangement of Line Segments and Related Problems
inferred← citeshttps://doi.org/10.1137/1.9781611972894.8openalex-snapshot
The Domination Heuristic for LP-type Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977066.6openalex-snapshot
Finding Relevant Points for Nearest-Neighbor Classification
inferred← citeshttps://doi.org/10.1137/21m1423324openalex-snapshot
Optimal Algorithms for Geometric Centers and Depth
inferred← citeshttps://doi.org/10.1137/s0097539703439404openalex-snapshot
Low-Dimensional Linear Programming with Violations
inferred← citeshttps://doi.org/10.1137/s009753970444572xopenalex-snapshot
Sublinear Geometric Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539792241928openalex-snapshot
Weighted Multidimensional Search and Its Application to Convex Optimization
inferred← citeshttps://doi.org/10.1137/s0097539793250287openalex-snapshot
A Subexponential Algorithm for Abstract Optimization Problems
inferred← citeshttps://doi.org/10.1137/s0097539797315410openalex-snapshot
New Lower Bounds for Convex Hull Problems in Odd Dimensions
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/s0218195906001987openalex-snapshot
SUPERIMPOSING VORONOI COMPLEXES FOR SHAPE DEFORMATION
inferred← citeshttps://doi.org/10.1142/s0218195998000126openalex-snapshot
A Complete Implementation for Computing General Dimensional Convex Hulls
inferred← citeshttps://doi.org/10.1145/1064092.1064121openalex-snapshot
Multi-pass geometric algorithms
inferred← citeshttps://doi.org/10.1145/1377676.1377696openalex-snapshot
Helly-type theorems for approximate covering
inferred← citeshttps://doi.org/10.1145/1377676.1377701openalex-snapshot
Markov incremental constructions
inferred← citeshttps://doi.org/10.1145/142675.142678openalex-snapshot
A subexponential bound for linear programming
inferred← citeshttps://doi.org/10.1145/142675.142734openalex-snapshot
Ray shooting in convex polytopes
inferred← citeshttps://doi.org/10.1145/166117.166148openalex-snapshot
Global visibility algorithms for illumination computations
inferred← citeshttps://doi.org/10.1145/177424.178040openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1145/195058.195113openalex-snapshot
On lazy randomized incremental construction
inferred← citeshttps://doi.org/10.1145/201019.201036openalex-snapshot
Las Vegas algorithms for linear and integer programming when the dimension is small
inferred← citeshttps://doi.org/10.1145/202840.202847openalex-snapshot
A survey of linear programming in randomized subexponential time
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/237218.237225openalex-snapshot
New lower bounds for convex hull problems in odd dimensions
inferred← citeshttps://doi.org/10.1145/237218.237347openalex-snapshot
On computing Voronoi diagrams by divide-prune-and-conquer
inferred← citeshttps://doi.org/10.1145/237218.237397openalex-snapshot
Fixed-dimensional linear programming queries made easy
inferred← citeshttps://doi.org/10.1145/2582112.2582171openalex-snapshot
Continuously Flattening Polyhedra Using Straight Skeletons
inferred← citeshttps://doi.org/10.1145/2746539.2746557openalex-snapshot
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
inferred← citeshttps://doi.org/10.1145/276884.276915openalex-snapshot
Geometric applications of a randomized optimization technique
inferred← citeshttps://doi.org/10.1145/2935764.2935766openalex-snapshot
Parallelism in Randomized Incremental Algorithms
inferred← citeshttps://doi.org/10.1145/2935764.2935767openalex-snapshot
Parallel Algorithms for Asymmetric Read-Write Costs
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/3173127.3173138openalex-snapshot
Computational Geometry Column 66
inferred← citeshttps://doi.org/10.1145/3350755.3400255openalex-snapshot
Randomized Incremental Convex Hull is Highly Parallel
inferred← citeshttps://doi.org/10.1145/336154.336186openalex-snapshot
Random sampling in geometric optimization
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/3639320openalex-snapshot
LeCo: Lightweight Compression via Learning Serial Correlations
inferred← citeshttps://doi.org/10.1145/3770855.3818102openalex-snapshot
Exact k -Center Clustering on Graphs for Small k
inferred← citeshttps://doi.org/10.1145/777792.777824openalex-snapshot
Incremental constructions con BRIO
inferred← citeshttps://doi.org/10.1155/2017/3956415openalex-snapshot
A Quick Negative Selection Algorithm for One‐Class Classification in Big Data Era
inferred← citeshttps://doi.org/10.1287/moor.18.4.964openalex-snapshot
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
inferred← citeshttps://doi.org/10.1287/moor.2022.1308openalex-snapshot
On Integer Programming, Discrepancy, and Convolution
inferred← citeshttps://doi.org/10.1371/journal.pone.0043706openalex-snapshot
Conic Sampling: An Efficient Method for Solving Linear and Quadratic Programming by Randomly Linking Constraints within the Interior
inferred← citeshttps://doi.org/10.14778/3547305.3547319openalex-snapshot
Time series data encoding for efficient storage
inferred← citeshttps://doi.org/10.17169/refubium-7379openalex-snapshot
Computational aspects of some problems from discrete geometry in higher dimensions
inferred← citeshttps://doi.org/10.20382/jocg.v7i2a3openalex-snapshot
Shortest path in a polygon using sublinear space
inferred← citeshttps://doi.org/10.22028/d291-25744openalex-snapshot
Interaktive Montageplanung mit Kollisionserkennung
inferred← citeshttps://doi.org/10.22215/etd/2021-14488openalex-snapshot
Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867484openalex-snapshot
A Computationally Governed Log-domain Interior-point Method for Model Predictive Control
inferred← citeshttps://doi.org/10.23919/ccc58697.2023.10240307openalex-snapshot
A Collision Avoidance Planning Algorithm in Cluttered Environments with Moving Obstacles
inferred← citeshttps://doi.org/10.32657/10220/49772openalex-snapshot
Time-optimal motion planning and control
inferred← citeshttps://doi.org/10.32657/10356/65864openalex-snapshot
Intrinsic computation of voronoi diagrams on surfaces and its application
inferred← citeshttps://doi.org/10.3390/math7010024openalex-snapshot
NLP Formulation for Polygon Optimization Problems
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.51openalex-snapshot
Improved Approximation Algorithms for Tverberg Partitions
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.50openalex-snapshot
Fast Algorithms for Geometric Consensuses
showing the first 200 of 214 · page through all 214
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.