New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing envelopes in four dimensions with applications
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM SIGACT News
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
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
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Fast rendering of irregular grids
Proceedings of the 1996 symposium on Volume visualization
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
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the union of κ-curved objects
Proceedings of the fourteenth annual symposium on Computational geometry
Constructing cuttings in theory and practice
Proceedings of the fourteenth annual symposium on Computational geometry
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Geometric algorithms for trap design
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
The complexity of the union of (&agr;, &bgr;)-covered objects
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
Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Determining an optimal penetration among weighted regions in two and three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
Proceedings of the sixth 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
Data structures for mobile data
SODA '97 Proceedings of the eighth 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
Kinetic collision detection between two simple polygons
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Queries with segments in Voronoi diagrams
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth 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
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A trace bound for the hereditary discrepancy
Proceedings of the sixteenth annual symposium on Computational geometry
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
Exact and approximation algorithms for minimum-width cylindrical shells
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Online point location in planar arrangements and its applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Maintaining approximate extent measures of moving points
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Geometric algorithms for the analysis of 2D-electrophoresis gels
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
On the number of congruent simplices in a point
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The union of congruent cubes in three dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Segment intersection searching problems in general settings
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
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM SIGACT News
Point-line incidences in space
Proceedings of the eighteenth annual symposium on Computational geometry
Lenses in arrangements of pseudo-circles and their applications
Proceedings of the eighteenth annual symposium on Computational geometry
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations
Proceedings of the eighteenth annual symposium on Computational geometry
Polyhedral Voronoi diagrams of polyhedra in three 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
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
On the overlay of envelopes in four dimensions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Polygon decomposition for efficient construction of Minkowski sums
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
Algebraic Geometry and Computer Vision: Polynomial Systems, Real andComplex Roots
Journal of Mathematical Imaging and Vision
A lower bound on Voronoi diagram complexity
Information Processing Letters
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids
IEEE Transactions on Visualization and Computer Graphics
Discrete Applied Mathematics
Shattering a set of objects in 2D
Discrete Applied Mathematics
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry: Theory and Applications
The Largest Empty Annulus Problem
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
The k-Median Problem for Directed Trees
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Partitioning Colored Point Sets into Monochromatic Parts
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Packing Convex Polygons into Rectangular Boxes
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Optimal Beam Penetrations in Two and Three Dimensions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Maximizing a Voronoi Region: The Convex Case
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An Efficient k Nearest Neighbor Searching Algorithm for a Query Line
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel
FST TCS '01 Proceedings of the 21st 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
Parametric Multiple Sequence Alignment and Phylogeny Construction
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Polygon Decomposition for Efficient Construction of Minkowski Sums
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Minimizing a Convex Cost Closure Set
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Smallest Color-Spanning Objects
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On the Clique Problem in Intersection Graphs of Ellipses
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry
Proceedings of the nineteenth annual symposium on Computational geometry
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
Proceedings of the nineteenth annual symposium on Computational geometry
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
Cutting triangular cycles of lines in space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An efficient k nearest neighbors searching algorithm for a query line
Theoretical Computer Science
Taking a Walk in a Planar Arrangement
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Journal of Computer and System Sciences - Special issue on PODS 2000
The weighted farthest color Voronoi diagram on trees and graphs
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
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)
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
European Journal of Combinatorics
On the number of views of translates of a cube and related problems
Computational Geometry: Theory and Applications
Information Processing Letters
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic collision detection between two simple polygons
Computational Geometry: Theory and Applications
Ready, set, go! the Voronoi diagram of moving points that start from a line
Information Processing Letters
On lines avoiding unit balls in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Algorithms for center and Tverberg points
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Continuous path verification in multi-axis NC-machining
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A 2D kinetic triangulation with near-quadratic topological changes
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the union of κ-round objects
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Point–Line Incidences in Space
Combinatorics, Probability and Computing
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Almost tight upper bounds for vertical decompositions in four dimensions
Journal of the ACM (JACM)
Kinetic collision detection with fast flight plan changes
Information Processing Letters
On the computation of an arrangement of quadrics in 3D
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Precise Voronoi cell extraction of free-form rational planar closed curves
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Forbidden patterns and unit distances
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Almost tight bound for a single cell in an arrangement of convex polyhedra in R3
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Guarding a terrain by two watchtowers
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
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
Pianos are not flat: rigid motion planning in three dimensions
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
Smallest k-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters
Conditional location of path and tree shaped facilities on trees
Journal of Algorithms
Bounding the distance between 2D parametric Bézier curves and their control polygon
Computing - Geometric modelling dagstuhl 2002
Polygonal chain approximation: a query based approach
Computational Geometry: Theory and Applications
Crossing patterns of semi-algebraic sets
Journal of Combinatorial Theory Series A
On the chromatic number of some geometric hypergraphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Computing obnoxious 1-corner polygonal chains
Computers and Operations Research
Proceedings of the twenty-second annual symposium on Computational geometry
Improved output-sensitive snap rounding
Proceedings of the twenty-second annual symposium on Computational geometry
On overlays and minimization diagrams
Proceedings of the twenty-second annual symposium on Computational geometry
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
Stability versus speed in a computable algebraic model
Theoretical Computer Science - Real numbers and computers
Three problems about simple polygons
Computational Geometry: Theory and Applications
Tolerance envelopes of planar mechanical parts
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Segmenting object space by geometric reference structures
ACM Transactions on Sensor Networks (TOSN)
Kinetic and dynamic data structures for convex hulls and upper envelopes
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Farthest line segment Voronoi diagrams
Information Processing Letters
On regular vertices on the union of planar objects
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Journal of Parallel and Distributed Computing
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Robust, generic and efficient construction of envelopes of surfaces in three-dimensional spaces
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On incremental rendering of silhouette maps of a polyhedral scene
Computational Geometry: Theory and Applications
On finding widest empty curved corridors
Computational Geometry: Theory and Applications
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
Theoretical Computer Science
Visibility maps of segments and triangles in 3D
Computational Geometry: Theory and Applications
Dynamics-aware similarity of moving objects trajectories
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Weak ε-nets and interval chains
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Covering point sets with two disjoint disks or squares
Computational Geometry: Theory and Applications
On the performance of the ICP algorithm
Computational Geometry: Theory and Applications
The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry
Extremal problems on triangle areas in two and three dimensions
Proceedings of the twenty-fourth annual symposium on Computational geometry
A simple and efficient kinetic spanner
Proceedings of the twenty-fourth annual symposium on Computational geometry
Bi-level path following for cross validated solution of kernel quantile regression
Proceedings of the 25th international conference on Machine learning
The nearest polynomial with a zero in a given domain from a geometrical viewpoint
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Optimal location of transportation devices
Computational Geometry: Theory and Applications
Stabbing Convex Polygons with a Segment or a Polygon
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms (TALG)
Weak ε-nets and interval chains
Journal of the ACM (JACM)
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Line transversals of convex polyhedra in R3
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Subdivision Drawings of Hypergraphs
Graph Drawing
Multi-dimensional dynamic facility location and fast computation at query points
Information Processing Letters
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Strongly polynomial-time truthful mechanisms in one shot
Theoretical Computer Science
Conflict-free coloring of unit disks
Discrete Applied Mathematics
Single facility collection depots location problem in the plane
Computational Geometry: Theory and Applications
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
Proceedings of the twenty-fifth annual symposium on Computational geometry
An improved bound on the number of unit area triangles
Proceedings of the twenty-fifth annual symposium on Computational geometry
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the twenty-fifth annual symposium on Computational geometry
Extremal problems on triangle areas in two and three dimensions
Journal of Combinatorial Theory Series A
On the dilation spectrum of paths, cycles, and trees
Computational Geometry: Theory and Applications
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Parametric analysis for ungapped Markov models of evolution
ACM Transactions on Algorithms (TALG)
Connect the Dot: Computing Feed-Links with Minimum Dilation
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the union of fat tetrahedra in three dimensions
Journal of the ACM (JACM)
A simple and efficient kinetic spanner
Computational Geometry: Theory and Applications
Shortest paths in time-dependent FIFO networks using edge load forecasts
Proceedings of the Second International Workshop on Computational Transportation Science
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
On the computation of an arrangement of quadrics in 3D
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
Three problems about simple polygons
Computational Geometry: Theory and Applications
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
Extremal point queries with lines and line segments and related problems
Computational Geometry: Theory and Applications
Tolerance envelopes of planar mechanical parts with parametric tolerances
Computer-Aided Design
Precise global collision detection in multi-axis NC-machining
Computer-Aided Design
Computing obnoxious 1-corner polygonal chains
Computers and Operations Research
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
Journal of the ACM (JACM)
Smallest k-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters
Kinetic collision detection with fast flight plan changes
Information Processing Letters
Conditional location of path and tree shaped facilities on trees
Journal of Algorithms
Optimal projections onto grids and finite resolution images
Journal of Visual Communication and Image Representation
Largest empty circle centered on a query line
Journal of Discrete Algorithms
Bi-Level Path Following for Cross Validated Solution of Kernel Quantile Regression
The Journal of Machine Learning Research
Arrangements in geometry: recent advances and challenges
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Farthest-polygon Voronoi diagrams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal triangulation with Steiner points
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Better bounds on the union complexity of locally fat objects
Proceedings of the twenty-sixth annual symposium on Computational geometry
Lines avoiding balls in three dimensions revisited
Proceedings of the twenty-sixth annual symposium on Computational geometry
Kinetic stable Delaunay graphs
Proceedings of the twenty-sixth annual symposium on Computational geometry
A kinetic triangulation scheme for moving points in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
On the bichromatic k-set problem
ACM Transactions on Algorithms (TALG)
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms (TALG)
Precise Hausdorff distance computation between polygonal meshes
Computer Aided Geometric Design
Geometric optimization and sums of algebraic functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Point location in the continuous-time moving network
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Optimal cover of points by disks in a simple polygon
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Theoretical Computer Science
A kinetic triangulation scheme for moving points in the plane
Computational Geometry: Theory and Applications
Farthest-polygon Voronoi diagrams
Computational Geometry: Theory and Applications
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
SIAM Journal on Computing
Search algorithm to find optimum strategies to shape political action with subjective assessment
ECS'10/ECCTD'10/ECCOM'10/ECCS'10 Proceedings of the European conference of systems, and European conference of circuits technology and devices, and European conference of communications, and European conference on Computer science
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
On the triangle-perimeter two-site Voronoi diagram
Transactions on computational science IX
On the triangle-perimeter two-site Voronoi diagram
Transactions on computational science IX
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
On the structure and composition of forbidden sequences, with geometric applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
On multiplicatively weighted Voronoi diagrams for lines in the plane
Transactions on computational science XIII
Non-uniform geometric matchings
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Ranking continuous nearest neighbors for uncertain trajectories
The VLDB Journal — The International Journal on Very Large Data Bases
On isolating points using disks
ESA'11 Proceedings of the 19th European conference on Algorithms
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
Journal of Symbolic Computation
Origins of Nonlinearity in Davenport-Schinzel Sequences
SIAM Journal on Discrete Mathematics
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
Strongly polynomial-time truthful mechanisms in one shot
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Exact and approximation algorithms for computing the dilation spectrum of paths, trees, and cycles
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Parametric analysis for ungapped markov models of evolution
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Improved bounds on the union complexity of fat objects
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Centdian computation for sensor networks
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Kinetic and dynamic data structures for convex hulls and upper envelopes
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Conflict-Free coloring made stronger
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Querying two boundary points for shortest paths in a polygonal domain
Computational Geometry: Theory and Applications
Continuous-time moving network voronoi diagram
Transactions on Computational Science XIV
A simple algorithm for approximate partial point set pattern matching under rigid motion
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Farthest voronoi diagrams under travel time metrics
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Tight bound for farthest-color voronoi diagrams of line segments
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Multi-robot adversarial patrolling: facing a full-knowledge opponent
Journal of Artificial Intelligence Research
Nearest-neighbor searching under uncertainty
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Journal of Combinatorial Theory Series A
On topological changes in the delaunay triangulation of moving points
Proceedings of the twenty-eighth annual symposium on Computational geometry
Coverage restricted to an angle
Operations Research Letters
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width
Operations Research Letters
One-way and round-trip center location problems
Discrete Optimization
Improved Bounds for Geometric Permutations
SIAM Journal on Computing
Optimal Cover of Points by Disks in a Simple Polygon
SIAM Journal on Computing
Batching and delivery in semi-online distribution systems
Discrete Applied Mathematics
Technical note: Uncertain lines and circles with dependencies
Computer-Aided Design
Measuring regularity of convex polygons
Computer-Aided Design
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
Kinetic data structures for all nearest neighbors and closest pair in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Sharp bounds on Davenport-Schinzel sequences of every order
Proceedings of the twenty-ninth annual symposium on Computational geometry
Union of random minkowski sums and network vulnerability analysis
Proceedings of the twenty-ninth annual symposium on Computational geometry
Nearest neighbor searching under uncertainty II
Proceedings of the 32nd symposium on Principles of database systems
Skeletal representations of orthogonal shapes
Graphical Models
Learning Big (Image) Data via Coresets for Dictionaries
Journal of Mathematical Imaging and Vision
Geometric optimization and sums of algebraic functions
ACM Transactions on Algorithms (TALG)
The resilience of WDM networks to probabilistic geographical failures
IEEE/ACM Transactions on Networking (TON)
Unreliable point facility location problems on networks
Discrete Applied Mathematics
Hi-index | 0.01 |