A note on relative neighborhood graphs
SCG '87 Proceedings of the third annual symposium on Computational geometry
Intersecting line segments in parallel with an output-sensitive number of processors
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Polling: a new randomized sampling technique for computational geometry
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Quasi-Valid range querying and its implications for nearest neighbor problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The complexity of many faces in arrangements of lines of segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Implicitly representing arrangements of lines or segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Algebraic methods for non-linear computational geometry (invited address)
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Globally-Equiangular triangulations of co-circular points in 0(n log n) time
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Triangles in space or building (and analyzing) castles in the Air
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Binary partitions with applications to hidden surface removal and solid modelling
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Degree complexity bounds on the intersection of algebraic curves
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Good splitters for counting points in triangles
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On the number of halving planes
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An acyclicity theorem for cell complexes in d dimensions
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An efficient algorithm for one-step planar complaint motion planning with uncertainty
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Sweeping arrangements of curves
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Stabbing pairwise disjoint translates in linear time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Incremental computation of planar maps
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
The implementation of an algorithm to find the convex hull of a set of three-dimensional points
ACM Transactions on Graphics (TOG)
IEEE Transactions on Computers
Improper intersection of algebraic curves
ACM Transactions on Graphics (TOG)
Generalized sweep methods for parallel computational geometry
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient parallel computation of arrangements of hyperplanes in d dimensions
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Cutting hyperplane arrangements
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Some new bounds for Epsilon-nets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The combinatorial complexity of hyperplane transversals
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Points and triangles in the plane and halving planes in space
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Stabbing and ray shooting in 3 dimensional space
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Enumeration and visibility problems in integer lattices (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Area and volume coherence for efficient visualization of 3D scalar functions
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Separators in two and three dimensions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
Finding compact coordinate representations for polygons and polyhedra
IBM Journal of Research and Development
Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Intersection queries for curved objects (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Randomized parallel algorithms for trapezoidal diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Extremal polygon containment problems
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The upper envelope of Voronoi surfaces and its applications
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On the sum of squares of cell complexities in hyperplane arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Optimality of the Delaunay triangulation in Rd
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Triangulation and CSG representation of polyhedra with arbitrary genus
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Walking on an arrangement topologically
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An efficient algorithm for CSG to b-rep conversion
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
The n-dimensional extended convex differences tree (ECDT) for representing polyhedra
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Constructing arrangements optimally in parallel (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Finding stabbing lines in 3-dimensional space
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Offline maintenance of planar configurations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximate submatrix matching problems
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
Efficient algorithms for the Hitchcock transportation problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Separation and approximation of polyhedral objects
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Incremental topological flipping works for regular triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An upper bound for conforming Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An efficient approach to removing geometric degeneracies
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A linear-time algorithm for testing the inscribability of trivalent polyhedra
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Three-dimensional alpha shapes
VVS '92 Proceedings of the 1992 workshop on Volume visualization
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
ACM Transactions on Graphics (TOG)
Generalized hidden surface removal
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On lines missing polyhedral sets in 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing a centerpoint of a finite planar set of points in linear time
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Approximating center points with iterated radon points
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
The union of balls and its dual shape
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An incremental algorithm for Betti numbers of simplicial complexes
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Counting triangle crossings and halving planes
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Decision trees for geometric models
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A model for n-dimensional boundary topology
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Bounds for the computational power and learning complexity of analog neural nets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Decision trees: old and new results
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved bounds on weak &egr;-nets for convex sets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Almost tight upper bounds for the single cell and zone problems in three dimensions
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On translational motion planning in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing many faces in arrangements of lines and segments
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Determining the castability of simple polyhedra
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Triangulating topological spaces
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
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient algorithms for generalized intersection searching on non-iso-oriented objects
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
ACM SIGACT News
Shortest paths in the plane with polygonal obstacles
Journal of the ACM (JACM)
Fast computation of shadow boundaries using spatial coherence and backprojections
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Geometric programming: a programming approach to geometric design
ACM Transactions on Graphics (TOG)
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Automatic reconstruction of surfaces and scalar fields from 3D scans
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
Proceedings of the eleventh annual symposium on Computational geometry
New lower bounds for Hopcroft's problem
Proceedings of the eleventh annual symposium on Computational geometry
The overlay of lower envelopes in three dimensions and its applications
Proceedings of the eleventh annual symposium on Computational geometry
A new technique for analyzing substructures in arrangements
Proceedings of the eleventh annual symposium on Computational geometry
How to cut pseudo-parabolas into segments
Proceedings of the eleventh annual symposium on Computational geometry
Rectilinear geodesics in 3-space (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower bounds for off-line range searching
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Hierarchical triangulation for multiresolution surface description
ACM Transactions on Graphics (TOG)
Noise-tolerant parallel learning of geometric concepts
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Computing Occlusion-Free Viewpoints
IEEE Transactions on Pattern Analysis and Machine Intelligence
Static analysis yields efficient exact integer arithmetic for computational geometry
ACM Transactions on Graphics (TOG)
ACM Computing Surveys (CSUR)
Temporally coherent conservative visibility (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
Splitting a complex of convex polytopes in any dimension
Proceedings of the twelfth annual symposium on Computational geometry
On computing Voronoi diagrams by divide-prune-and-conquer
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Approaching the largest &bgr;-skeleton within a minimum weight triangulation
Proceedings of the twelfth annual symposium on Computational geometry
Approximating shortest paths on a convex polytope in three dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Disk packings and planar separators
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Noise-tolerant distribution-free learning of general geometric concepts
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Strategic directions in computational geometry
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Polynomial-Time Geometric Matching for Object Recognition
International Journal of Computer Vision
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Efficient Pose Clustering Using a Randomized Algorithm
International Journal of Computer Vision
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A perturbation scheme for spherical arrangements with application to molecular modeling
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Average-case ray shooting and minimum weight triangulations
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A computational basis for higher-dimensional computational geometry and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
The area bisectors of a polygon and force equilibria in programmable vector fields
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Voronoi diagram in statistical parametric space by Kullback-Leibler divergence
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating shortest paths on a convex polytope in three dimensions
Journal of the ACM (JACM)
Orthogonal polyhedra as geometric bounds in constructive solid geometry
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Results on k-sets and j-facets via continuous motion
Proceedings of the fourteenth annual symposium on Computational geometry
Degenerate convex hulls on-line in any fixed dimension
Proceedings of the fourteenth annual symposium on Computational geometry
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Voronoi diagrams by divergences with additive weights
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient co-triangulation of large data sets
Proceedings of the conference on Visualization '98
Noise-tolerant distribution-free learning of general geometric concepts
Journal of the ACM (JACM)
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Approximate Geometric Pattern Matching Under Rigid Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient algorithms for maximum regression depth
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Pipes, cigars, and kreplach: the union of Minkowski sums in three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh 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
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A practical approximation algorithm for the LMS line estimator
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Partial matching of planar polylines under similarity transformations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Comparing point sets under projection
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Motion planning of a ball amid segments in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal binary space partitions for orthogonal objects
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Applying parallel processing techniques to classification problems in constructive solid geometry
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Compact interval trees: a data structure for convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Fixed-point query languages for linear constraint databases
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the sixteenth annual symposium on Computational geometry
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Voronoi-based interpolation with higher continuity
Proceedings of the sixteenth annual symposium on Computational geometry
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
Proceedings of the sixteenth annual symposium on Computational geometry
An optimal algorithm for hyperplane depth in the plane
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimizing the sum of linear fractional functions and applications
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
Simplified kinetic connectivity for rectangles and hypercubes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fast implementation of depth contours using topological sweep
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixth ACM symposium on Solid modeling and applications
An efficient algorithm for finding the CSG representation of a simple polygon
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The Clarkson-Shor technique revisited and extended
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Efficient and small representation of line arrangements with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Monotone paths in line arrangement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Voronoi diagrams on piecewise flat surfaces and an application to biological growth
Theoretical Computer Science
An algorithm to compute the convex hull in the plane from the distance matrix
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Point-line incidences in space
Proceedings of the eighteenth annual symposium on Computational geometry
Incidences between points and circles in three and higher dimensions
Proceedings of the eighteenth annual symposium on Computational geometry
Improved construction of vertical decompositions of three-dimensional arrangements
Proceedings of the eighteenth annual symposium on Computational geometry
Smooth-surface reconstruction in near-linear time
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pseudo-line arrangements: duality, algorithms, and applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A multi-resolution topological representation for non-manifold meshes
Proceedings of the seventh ACM symposium on Solid modeling and applications
Low latency photon mapping using block hashing
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
The Computing Capacity of Three-Input Multiple-Valued One-Threshold Perceptrons
Neural Processing Letters
Regular triangulations of dynamic sets of points
Computer Aided Geometric Design
Computing a Minimum Weight Triangulation of a Sparse Point Set
Journal of Global Optimization
A Geometric Approach to Global Optimization
Journal of Global Optimization
On Covering Methods for D.C. Optimization
Journal of Global Optimization
A lower bound on Voronoi diagram complexity
Information Processing Letters
On the complexity of one-shot translational separability
Information Processing Letters
On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data
IEEE Transactions on Visualization and Computer Graphics
Delaunay Triangulation Using a Uniform Grid
IEEE Computer Graphics and Applications
Delaunay Triangulation in Three Dimensions
IEEE Computer Graphics and Applications
Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space
IEEE Transactions on Knowledge and Data Engineering
Learning Separations by Boolean Combinations of Half-Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Monotone paths in line arrangements
Computational Geometry: Theory and Applications
On the ordinary line problem in computational geometry
Nordic Journal of Computing
An O(log log n) time algorithm to compute the kernel of a polygon
Nordic Journal of Computing
A note on higher order Voronoi diagrams
Nordic Journal of Computing
Finding an ordinary conic and an ordinary hyperplane
Nordic Journal of Computing
A fast algorithm for the alpha-connected two-center decision problem
Information Processing Letters
Selecting Data Distributions for Unbounded Loops
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Optimization over k-set Polytopes and Efficient k-set Enumeration
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Optimization over Zonotopes and Training Support Vector Machines
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Using the Real Dimension of the Data
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
The Construction of Delaunay Diagrams by Lob Reduction
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Nonregular Triangulations, View Graphs of Triangulations, and Linear Programming Duality
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Bisecting Two Subsets in 3-Connected Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Optimal Beam Penetrations in Two and Three Dimensions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Topological Peeling and Implementation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Bounded-Degree Independent Sets in Planar Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An Efficient k Nearest Neighbor Searching Algorithm for a Query Line
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
A Case Study on the Cost of Geometric Computing
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Binary Space Partitions in Plücker Space
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Topological Sweep in Degenerate Cases
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
An Experimental Study and Comparison of Topological Peeling and Topological Walk
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Inferring a Union of Halfspaces from Examples
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Approximation Techniques for Indexing Two-Dimensional Constraint Databases
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On-Line Zone Construction in Arrangements of Lines in the Plane
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Approximation Algorithms for Finding Best Viewpoints
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Parametric Multiple Sequence Alignment and Phylogeny Construction
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On the Complexity of Deriving Position Specific Score Matrices from Examples
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Contour Lines and DEM: Generation and Extraction
DEM '01 Proceedings of the First International Symposium on Digital Earth Moving
Finding an Optimal Path without Growing the Tree
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Dynamically Maintaining the Widest k -Dense Corridor
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A Question of Digital Linear Algebra
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Non-manifold Decomposition in Arbitrary Dimensions
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Reconstruction of Animated Models from Images Using Constrained Deformable Surfaces
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Exploiting color and topological features for region segmentation with recursive fuzzy C-means
Machine Graphics & Vision International Journal - Special issue on latest results in colour image processing and applications
Output-sensitive cell enumeration in hyperplane arrangements
Nordic Journal of Computing
Time-series similarity problems and well-separated geometric sets
Nordic Journal of Computing
Dynamic maintenance and visualization of molecular surfaces
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
The minimum expectation selection problem
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
Sets of lines and cutting out polyhedral objects
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
High-dimensional shape fitting in linear time
Proceedings of the nineteenth annual symposium on Computational geometry
Long monotone paths in line arrangements
Proceedings of the nineteenth annual symposium on Computational geometry
Computer graphics companion
Data management in environmental information systems
Handbook of massive data sets
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Computational Geometry: Theory and Applications
An efficient k nearest neighbors searching algorithm for a query line
Theoretical Computer Science
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Taking a Walk in a Planar Arrangement
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exact Computation of 4-D Convex Hulls with Perturbation and Acceleration
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Algorithms for bivariate medians and a Fermat--Torricelli problem for lines
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Tutte's barycenter method applied to isotopies
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Swept volumes and their use in viewpoint computation in robot work-cells
ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning
Complete indexing strategies for sparse sensing techniques
ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning
A scalable data structure for three-dimensional non-manifold objects
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A concise b-rep data structure for stratified subanalytic objects
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Decomposing non-manifold objects in arbitrary dimensions
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
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
Multiscale Medial Loci and Their Properties
International Journal of Computer Vision - Special Issue on Research at the University of North Carolina Medical Image Display Analysis Group (MIDAG)
Fast analytical computation of Richards's smooth molecular surface
VIS '93 Proceedings of the 4th conference on Visualization '93
Triangulation and display of rational parametric surfaces
VIS '94 Proceedings of the conference on Visualization '94
Processing in-route nearest neighbor queries: a comparison of alternative approaches
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Finding an optimal path without growing the tree
Journal of Algorithms
The Clarkson–Shor Technique Revisited and Extended
Combinatorics, Probability and Computing
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM (JACM)
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles
Combinatorics, Probability and Computing
Algorithms for center and Tverberg points
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Solution of Scott's problem on the number of directions determined by a point set in 3-space
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the Limits of Second Generation Watermarks
CRV '04 Proceedings of the 1st Canadian Conference on Computer and Robot Vision
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Point–Line Incidences in Space
Combinatorics, Probability and Computing
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Computational Geometry: Theory and Applications
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Kinetic collision detection with fast flight plan changes
Information Processing Letters
A data structure for non-manifold simplicial d-complexes
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
In-Route Nearest Neighbor Queries
Geoinformatica
Incidences of not-too-degenerate hyperplanes
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Provable dimension detection using principal component analysis
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On levels in arrangements of surfaces in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On geometric permutations induced by lines transversal through a fixed point
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Ray shooting amid balls, farthest point from a line, and range emptiness searching
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Encyclopedia of Computer Science
Smallest k-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters
When can a net fold to a polyhedron?
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Harmonic functions for quadrilateral remeshing of arbitrary manifolds
Computer Aided Geometric Design - Special issue: Geometry processing
On some monotone path problems in line arrangements
Computational Geometry: Theory and Applications
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the number of crossing-free matchings, (cycles, and partitions)
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The predicates of the Apollonius diagram: algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Pre-triangulations and liftable complexes
Proceedings of the twenty-second annual symposium on Computational geometry
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems
Computers and Operations Research
A robust algorithm for bisecting a triconnected graph with two resource sets
Theoretical Computer Science
Update operations on 3D simplicial decompositions of non-manifold objects
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Point set stratification and Delaunay depth
Computational Statistics & Data Analysis
Sliver-free perturbation for the Delaunay tetrahedrization
Computer-Aided Design
On the complexity of deriving position specific score matrices from positive and negative sequences
Discrete Applied Mathematics
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set
Information Processing Letters
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
INFORMS Journal on Computing
On regular vertices on the union of planar objects
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Similar simplices in a d-dimensional point set
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Voronoi diagrams in n · 2o(√lg lg n) time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Finding near neighbors through cluster pruning
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bisecting a 4-connected graph with three resource sets
Discrete Applied Mathematics
Linearly independent split systems
European Journal of Combinatorics
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots
International Journal of Robotics Research
Data structures for simplicial complexes: an analysis and a comparison
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
A decomposition-based representation for 3D simplicial complexes
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Shape reconstruction from unorganized cross-sections
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for bivariate zonoid depth
Computational Geometry: Theory and Applications
Efficiency-quality tradeoffs for vector score aggregation
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Computation of local radius of information in SM-IBC identification of nonlinear systems
Journal of Complexity
An optimal randomized algorithm for d-variate zonoid depth
Computational Geometry: Theory and Applications
On the bichromatic k-set problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Note: Computing closest and farthest points for a query segment
Theoretical Computer Science
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
Combinatorics, Probability and Computing
Journal of Symbolic Computation
Smooth natural neighbour interpolants over the whole domain
International Journal of Computational Science and Engineering
Representing non-manifold geometric objects in n dimensions: incidence, order, and shape
ISCGAV'06 Proceedings of the 6th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Computing Phylogenetic Diversity for Split Systems
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Reeb spaces of piecewise linear mappings
Proceedings of the twenty-fourth annual symposium on Computational geometry
On the lower envelope of bivariate functions and its applications
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Optimal complexity reduction of polyhedral piecewise affine systems
Automatica (Journal of IFAC)
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Automated design of scoring rules by learning from examples
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Mechanisms for information elicitation
Artificial Intelligence
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Reconstruction of Tree Crown Shape from Scanned Data
Edutainment '08 Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Relative Convex Hulls in Semi-dynamic Subdivisions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Algorithms for center and Tverberg points
ACM Transactions on Algorithms (TALG)
Efficient algorithms for reverse proximity query problems
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Depth of segments and circles through points enclosing many points: a note
Computational Geometry: Theory and Applications
A theory-based decision heuristic for DPLL(T)
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Computing zonoid trimmed regions of dimension d2
Computational Statistics & Data Analysis
Dynamic ham-sandwich cuts in the plane
Computational Geometry: Theory and Applications
Computational Geometry from the Viewpoint of Affine Differential Geometry
Emerging Trends in Visual Computing
The learnability of voting rules
Artificial Intelligence
New results on lower bounds for the number of (≤k)-facets
European Journal of Combinatorics
New Complexity Bounds for Image Matching under Rotation and Scaling
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Mechanisms for partial information elicitation: the truth, but not the whole truth
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM (JACM)
A new framework for reasoning about points, intervals and durations
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Theoretical Computer Science
When can a net fold to a polyhedron?
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
On some monotone path problems in line arrangements
Computational Geometry: Theory and Applications
The predicates of the Apollonius diagram: Algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Harmonic functions for quadrilateral remeshing of arbitrary manifolds
Computer Aided Geometric Design - Special issue: Geometry processing
Tolerance envelopes of planar mechanical parts with parametric tolerances
Computer-Aided Design
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A computational geometry method for localization using differences of distances
ACM Transactions on Sensor Networks (TOSN)
Tree-Based Encoding for Cancellations on Morse Complexes
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics
Smallest k-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters
Kinetic collision detection with fast flight plan changes
Information Processing Letters
Intelligent control for wall climbing robot
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
Discrete critical values: a general framework for silhouettes computation
SGP '09 Proceedings of the Symposium on Geometry Processing
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Internalized plans: A representation for action resources
Robotics and Autonomous Systems
On the complexity of affine image matching
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Maximum stabbing line in 2D plane
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Efficient mode enumeration of compositional hybrid systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Image segmentation using topological persistence
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Methods toward in vivo measurement of zebrafish epithelial and deep cell proliferation
Computer Methods and Programs in Biomedicine
Arrangements in geometry: recent advances and challenges
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Cancellation of critical points in 2D and 3D Morse and Morse-Smale complexes
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
A ghost cell-based data structure for multiresolution meshes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Points with large quadrant-depth
Proceedings of the twenty-sixth annual symposium on Computational geometry
On the bichromatic k-set problem
ACM Transactions on Algorithms (TALG)
Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
IEEE Transactions on Information Theory
Efficient on-line algorithms for Euler diagram region computation
Computational Geometry: Theory and Applications
The multi-facility median problem with Pos/Neg weights on general graphs
Computers and Operations Research
On the qualitative structure of a mechanical assembly
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Journal of Global Optimization
Orthogonal ham-sandwich theorem in R3
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Affine image matching is uniform TC0-complete
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
A geometric approach to the segmentation of range images
3DIM'99 Proceedings of the 2nd international conference on 3-D digital imaging and modeling
Exact computation of bivariate projection depth and the Stahel-Donoho estimator
Computational Statistics & Data Analysis
New complexity bounds for image matching under rotation and scaling
Journal of Discrete Algorithms
Stabbers of line segments in the plane
Computational Geometry: Theory and Applications
HOT: Hodge-optimized triangulations
ACM SIGGRAPH 2011 papers
On the number of separable partitions
Journal of Combinatorial Optimization
Learning Combinatorial Map Information from Permutations of Landmarks
International Journal of Robotics Research
The ordinary line problem revisited
Computational Geometry: Theory and Applications
Learning-Related complexity of linear ranking functions
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Classification using scale and rotation tolerant shape signatures from convex hulls
ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II
Practical construction of k-nearest neighbor graphs in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
SINR diagram with interference cancellation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Delineating boundaries for imprecise regions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Equivalence between regular n-G-maps and n-surfaces
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Competing output-sensitive frame algorithms
Computational Geometry: Theory and Applications
Triangulating a convex polygon with small number of non-standard bars
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Efficient non-intersection queries on aggregated geometric data
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Panoramic mesh model generation from multiple range data for indoor scene reconstruction
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Bisecting a four-connected graph with three resource sets
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Point sets and frame algorithms in management
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
In-place randomized slope selection
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Induced subgraphs of bounded degree and bounded treewidth
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On zero duality gap in nonconvex quadratic programming problems
Journal of Global Optimization
Representing topological structures using cell-chains
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Verifying nash equilibria in pagerank games on undirected web graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Designing and proving correct a convex hull algorithm with hypermaps in Coq
Computational Geometry: Theory and Applications
Brief On absolute stability analysis by polyhedral Lyapunov functions
Automatica (Journal of IFAC)
Approximating Tverberg points in linear time for any fixed dimension
Proceedings of the twenty-eighth annual symposium on Computational geometry
Min-Max payoffs in a two-player location game
Operations Research Letters
Reachability determination in acyclic Petri nets by cell enumeration approach
Automatica (Journal of IFAC)
On some geometric selection and optimization problems via sorted matrices
Computational Geometry: Theory and Applications
Facility location problems with uncertainty on the plane
Discrete Optimization
Linear time algorithms for some separable quadratic programming problems
Operations Research Letters
Improved complexity bounds for location problems on the real line
Operations Research Letters
Finding minimum area simple pentagons
Operations Research Letters
A comment on a minmax location problem
Operations Research Letters
Optimal and approximate bottleneck Steiner trees
Operations Research Letters
Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent
Computer Graphics Forum
A geometric approach to sample compression
The Journal of Machine Learning Research
Fundamenta Informaticae
Faster geometric algorithms via dynamic determinant computation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Data-driven neuroscience: enabling breakthroughs via innovative data management
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques
INFORMS Journal on Computing
Multi-resolution cell complexes based on homology-preserving euler operators
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Computational Geometry: Theory and Applications
Distance-Sensitive planar point location
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Information Processing Letters
a-tint: A polymake extension for algorithmic tropical intersection theory
European Journal of Combinatorics
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
Theory of Computing Systems
Topological modifications and hierarchical representation of cell complexes in arbitrary dimensions
Computer Vision and Image Understanding
| Hi-index | 0.08 |