Out-of-Roundness Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Maintaining the minimal distance of a point set in polylogarithmic time
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Stable placements for spider robots
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Compatible tetrahedralizations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Fast greedy triangulation algorithms
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Linear-size nonobtuse triangulation of polygons
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Hierarchical triangulation for multiresolution surface description
ACM Transactions on Graphics (TOG)
Fitting a set of points by a circle
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Proceedings of the fourteenth annual symposium on Computational geometry
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
On deletion in Delaunay triangulations
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
Circular separability of polygon
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A near-optimal heuristic for minimum weight triangulation of convex polygons
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A fully dynamic algorithm for planar
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On computing the optimal bridge between two convex polygons
Information Processing Letters
Rapid and accurate computation of the distance function using grids
Journal of Computational Physics
Packing two disks in a polygon
Computational Geometry: Theory and Applications
Triangulating convex polygons having T-vertices
Journal of Graphics Tools
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Optimizing Constrained Offset and Scaled Polygonal Annuli
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
The Construction of Delaunay Diagrams by Lob Reduction
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Two-Center Problems for a Convex Polygon (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Splitting a Delaunay Triangulation in Linear Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Java applets for the dynamic visualization of Voronoi diagrams
Computer Science in Perspective
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Finding optimal weighted bridges with applications
Proceedings of the 44th annual Southeast regional conference
Farthest line segment Voronoi diagrams
Information Processing Letters
Weighted skeletons and fixed-share decomposition
Computational Geometry: Theory and Applications
Self-improving algorithms for delaunay triangulations
Proceedings of the twenty-fourth annual symposium on Computational geometry
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Constrained minimum enclosing circle with center on a query line segment
Computational Geometry: Theory and Applications
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Compressing spatio-temporal trajectories
Computational Geometry: Theory and Applications
Abstract Voronoi diagrams revisited
Computational Geometry: Theory and Applications
Resolving Loads with Positive Interior Stresses
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry: Theory and Applications
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Analysis of higher order Voronoi diagram for fuzzy information coverage
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Algorithms and theory of computation handbook
Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization
Computational Geometry: Theory and Applications
Reachability by paths of bounded curvature in a convex polygon
Computational Geometry: Theory and Applications
An output-sensitive approach for the L1/L∞k-nearest-neighbor Voronoi diagram
ESA'11 Proceedings of the 19th European conference on Algorithms
SIAM Journal on Computing
A voronoi diagram approach to autonomous clustering
DS'06 Proceedings of the 9th international conference on Discovery Science
Farthest-Point queries with geometric and combinatorial constraints
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
On solving coverage problems in a wireless sensor network using voronoi diagrams
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Constrained minimum enclosing circle with center on a query line segment
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Data structures for halfplane proximity queries and incremental voronoi diagrams
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Voronoi-like partition of lattice in cellular automata
Mathematical and Computer Modelling: An International Journal
A double-circle algorithm for ore classification
Machine Graphics & Vision International Journal
Compatible Tetrahedralizations
Fundamenta Informaticae
Voronoi tessellation based rapid coverage decision algorithm for wireless sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Computers and Electronics in Agriculture
| Hi-index | 0.01 |