Cylindrical algebraic decomposition I: the basic algorithm
SIAM Journal on Computing
A new polynomial-time algorithm for linear programming
Combinatorica
Computing the extreme distances between two convex polygons
Journal of Algorithms
A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
Planar point location using persistent search trees
Communications of the ACM
Computing a ham-sandwich cut in two dimensions
Journal of Symbolic Computation
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Linear programming in O(n × 3d2) time
Information Processing Letters
On the complexity of nonconvex covering
SIAM Journal on Computing
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On k-hulls and related problems
SIAM Journal on Computing
Estimation of a circular arc center and its radius
Computer Vision, Graphics, and Image Processing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A heuristic for the p-center problem in graphs
Discrete Applied Mathematics
Fast approximation algorithms for a nonconvex covering problem
Journal of Algorithms
A graph based approach to object feature recognition
SCG '87 Proceedings of the third annual symposium on Computational geometry
Algorithms for clustering data
Algorithms for clustering data
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the detection of a common intersection of k convex polyhedra
Proceedings on International Workshop on Computational Geometry on Computational Geometry and its Applications
On the detection of a common intersection of k convex objects in the plane
Information Processing Letters
Sorting in c log n parallel steps
Combinatorica
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
L-infinity interdistance selection by parametric search
Information Processing Letters
Large sample bias in least squares estimators of a circular arc center and its radius
Computer Vision, Graphics, and Image Processing
A simple approach for the estimation of circular arc center and its radius
Computer Vision, Graphics, and Image Processing
Discrete & Computational Geometry
An optimal-time algorithm for slope selection
SIAM Journal on Computing
Algebraic optimization: the Fermat-Weber location problem
Mathematical Programming: Series A and B
A randomized algorithm for fixed-dimensional linear programming
Mathematical Programming: Series A and B
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Applications of generalized matrix searching to geometric algorithms
Discrete Applied Mathematics - Computational combinatiorics
An optimal parallel algorithm for linear programming in the plane
Information Processing Letters
Parallel searching in generalized Monge arrays with applications
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Computing the minimum Hausdorff distance for point sets under translation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On the complexity of some geometric problems in unbounded dimension
Journal of Symbolic Computation
Object recognition by computer: the role of geometric constraints
Object recognition by computer: the role of geometric constraints
On weighted rectilinear 2-center and 3-center problems
Information Sciences: an International Journal
Out-of-Roundness Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
Computing shortest transversals of sets (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Optimal algorithms for some smallest intersection radius problems (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Journal of Algorithms
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science
Computing shortest transversals
Computing
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Randomized optimal algorithm for slope selection
Information Processing Letters
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Scatter/Gather: a cluster-based approach to browsing large document collections
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Incremental clustering for dynamic information processing
ACM Transactions on Information Systems (TOIS)
Finding the repeated median regression line
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Using separation algorithms in fixed dimension
Journal of Algorithms
A class of convex programs with applications to computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Journal of Algorithms
Off-line dynamic maintenance of the width of a planar point set
Computational Geometry: Theory and Applications
Computing a segment center for a planar point set
Journal of Algorithms
Minimizing the sum of diameters efficiently
Computational Geometry: Theory and Applications
Constant interaction-time scatter/gather browsing of very large document collections
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Ray shooting and parametric search
SIAM Journal on Computing
How to allocate network centers
Journal of Algorithms
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Matrix searching with the shortest path metric
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A convex polygon among polygonal obstacles: placement and high-clearance motion
Computational Geometry: Theory and Applications
Approximate parametric searching
Information Processing Letters
A faster algorithm for the two-center decision problem
Information Processing Letters
Optimal slope selection via expanders
Information Processing Letters
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
SIAM Journal on Computing
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An efficient algorithm for the Euclidean two-center problem
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A single-exponential upper bound for finding shortest paths in three dimensions
Journal of the ACM (JACM)
Extremal polygon containment problems
Computational Geometry: Theory and Applications
Computing the smallest k-enclosing circle and related problems
Computational Geometry: Theory and Applications
Applications of parametric searching in geometric optimization
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
k-Violation linear programming
Information Processing Letters
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
A survey of linear programming in randomized subexponential time
ACM SIGACT News
On enclosing k points by a circle
Information Processing Letters
Randomized algorithms
A Subexponential Algorithm for Abstract Optimization Problems
SIAM Journal on Computing
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
An image retrieval model based on classical logic
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Static and dynamic algorithms for k-point clustering problems
Journal of Algorithms
Separation and approximation of polyhedral objects
Computational Geometry: Theory and Applications
An optimal algorithm for roundness determination on convex polygons
Computational Geometry: Theory and Applications
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
A parallel algorithm for linear programming in fixed dimension
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for the intersection radius of a set of convex polygons
Journal of Algorithms
Weighted Multidimensional Search and itsApplication to Convex Optimization
SIAM Journal on Computing
Ray Shooting Amidst Convex Polyhedra and PolyhedralTerrains in Three Dimensions
SIAM Journal on Computing
Repetitive hidden surface removal for polyhedra
Journal of Algorithms
A deterministic algorithm for the three-dimensional diameter problem
Computational Geometry: Theory and Applications
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Approximating monotone polygonal curves using the uniform metric
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for geometric problems
Approximation algorithms for NP-hard problems
Image organization and retrieval with automatically constructed feature vectors
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
A Deterministic poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension
SIAM Journal on Computing
Ray shooting amidst convex polygons in 2D
Journal of Algorithms
On linear-time deterministic algorithms for optimization problems in fixed dimension
Journal of Algorithms
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
SIAM Journal on Computing
Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Intersection of unit-balls and diameter of point set in R3
Computational Geometry: Theory and Applications
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
View-dependent refinement of progressive meshes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
View-dependent simplification of arbitrary polygonal environments
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A complete roundness classification procedure
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Fitting a set of points by a circle
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
RAPID: randomized pharmacophore identification for drug design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
An Expander-Based Approach to Geometric Optimization
SIAM Journal on Computing
Computing Envelopes in Four Dimensions with Applications
SIAM Journal on Computing
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for terrain simplification
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Line transversals of balls and smallest enclosing cylinders in three dimensions
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast hierarchical clustering and other applications of dynamic closest pairs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximation algorithms for clustering
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Octree-R: An Adaptive Octree for Efficient Ray Tracing
IEEE Transactions on Visualization and Computer Graphics
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improvements on Geometric Pattern Matching Problems
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
An Interval Classifier for Database Mining Applications
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Weighted Orthogonal Linear L\infty-Approximation and Applications
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Algorithms for Polytope Covering and Approximation
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
The Impact of Global Clustering on Spatial Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
On Some Geometric Selection and Optimization Problems via Sorted Matrices
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Computing Constrained Minimum-Width Annuli of Point Sets
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
SPRINT: A Scalable Parallel Classifier for Data Mining
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Computing the Maximum Overlap of Two Convex Polygons Under Translations
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Linear Programming - Randomization and Abstract Frameworks
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Computing a Largest Empty Anchored Cylinder, and Related Problems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Geometric Pattern Matching in d-Dimensional Space
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
The Capacitated K-Center Problem (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Maintaining Multiple Levels of Detail in the Overlay of Hierarchical Sub Divisions
Proceedings of the 8th Canadian Conference on Computational Geometry
Efficient Algorithms for the Smallest Enclosing Cylinder Problem
Proceedings of the 8th Canadian Conference on Computational Geometry
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
An Efficient Multi-Dimensional Searching Technique and itsApplications
An Efficient Multi-Dimensional Searching Technique and itsApplications
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Improved algorithms in geometric optimization via expanders
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Exact and approximation algorithms for clustering
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
Parametric search made practical
Proceedings of the eighteenth annual symposium on Computational geometry
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation Algorithms for k-Line Center
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Reconstruction of Animated Models from Images Using Constrained Deformable Surfaces
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Efficient algorithms for shared camera control
Proceedings of the nineteenth annual symposium on Computational geometry
Approximation algorithms for projective clustering
Journal of Algorithms
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
A linear incremental algorithm for naive and standard digital lines and planes recognition
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating extent measures of points
Journal of the ACM (JACM)
Parametric search made practical
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum-cost load-balancing partitions
Proceedings of the twenty-second annual symposium on Computational geometry
Minimum-cost coverage of point sets by disks
Proceedings of the twenty-second annual symposium on Computational geometry
Algorithms for two-box covering
Proceedings of the twenty-second annual symposium on Computational geometry
Three problems about simple polygons
Computational Geometry: Theory and Applications
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition
Efficient algorithm for placing a given number of base stations to cover a convex region
Journal of Parallel and Distributed Computing
Skinning arbitrary deformations
Proceedings of the 2007 symposium on Interactive 3D graphics and games
The Minmax Relative Regret Median Problem on Networks
INFORMS Journal on Computing
Application of beamforming in wireless location estimation
EURASIP Journal on Applied Signal Processing
Computing the least quartile difference estimator in the plane
Computational Statistics & Data Analysis
Computational Geometry: Theory and Applications
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
New Algorithms for k-Center and Extensions
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Fitting a Step Function to a Point Set
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Watershed segmentation using prior shape and appearance knowledge
Image and Vision Computing
Computers and Operations Research
Cache-oblivious selection in sorted X+Y matrices
Information Processing Letters
Computational Geometry: Theory and Applications
Improved Binary Space Partition merging
Computer-Aided Design
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Three problems about simple polygons
Computational Geometry: Theory and Applications
Extremal point queries with lines and line segments and related problems
Computational Geometry: Theory and Applications
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An improved algorithm for point set pattern matching under rigid motion
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Computing a largest empty arbitrary oriented rectangle: theory and implementation
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Arrangements in geometry: recent advances and challenges
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Game-theoretic learning algorithm for a spatial coverage problem
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Generalized Convexity in Multiple View Geometry
Journal of Mathematical Imaging and Vision
Incremental Facility Location Problem and Its Competitive Algorithms
Journal of Combinatorial Optimization
Simple wriggling is hard unless you are a fat hippo
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
A randomized algorithm for weighted approximation of points by a step function
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Computational Geometry: Theory and Applications
On the discrete unit disk cover problem
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Solving the constrained p-center problem using heuristic algorithms
Applied Soft Computing
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms (TALG)
Minimum width rectangular annulus
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
How to cover a point set with a V-shape of minimum width
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
New algorithms for 1-D facility location and path equipartition problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Facility location in a global view
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Multi-robot three-dimensional coverage of unknown areas
International Journal of Robotics Research
Bichromatic 2-center of pairs of points
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Facility location problems with uncertainty on the plane
Discrete Optimization
Gossip Coverage Control for Robotic Networks: Dynamical Systems on the Space of Partitions
SIAM Journal on Control and Optimization
How to cover a point set with a V-shape of minimum width
Computational Geometry: Theory and Applications
Minimum-width rectangular annulus
Theoretical Computer Science
An approximation algorithm for k-center problem on a convex polygon
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, prune-and-search techniques for linear programming and related problems, and LP-type problems and their efficient solution. We then describe a wide range of applications of these and other techniques to numerous problems in geometric optimization, including facility location, proximity problems, statistical estimators and metrology, placement and intersection of polygons and polyhedra, and ray shooting and other query-type problems.