An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
Journal of the ACM (JACM)
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
SCG '86 Proceedings of the second annual symposium on Computational geometry
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
On the geodesic Voronoi diagram of point sites in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
SCG '87 Proceedings of the third annual symposium on Computational geometry
A note on relative neighborhood graphs
SCG '87 Proceedings of the third annual symposium on Computational geometry
Parallel geometric algorithms on mesh-connected computers
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine
IEEE Transactions on Pattern Analysis and Machine Intelligence
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
On the topological shape of planar Voronoi diagrams
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Convex distance functions in 3-space are different
SCG '93 Proceedings of the ninth 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
Rectilinear geodesics in 3-space (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
A zero-skew clock routing scheme for VLSI circuits
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Scripting highly autonomous simulation behavior using case-based reasoning
ANSS '92 Proceedings of the 25th annual symposium on Simulation
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A practical algorithm for computing the Delaunay triangulation for convex distance functions
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Distance problems in computational geometry with fixed orientations
SCG '85 Proceedings of the first annual symposium on Computational geometry
Voronoi diagrams based on convex distance functions
SCG '85 Proceedings of the first annual symposium on Computational geometry
Voronoi diagrams and arrangements
SCG '85 Proceedings of the first annual symposium on Computational geometry
Fast spatial clustering with different metrics and in the presence of obstacles
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
A Systolic Algorithm for the k-Nearest Neighbors Problem
IEEE Transactions on Computers
On Some Optimization Problems in Obnoxious Facility Location
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Polygon labelling of minimum leader length
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Stable marker-particle method for the Voronoi diagram in a flow field
Journal of Computational and Applied Mathematics
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
Computational Geometry: Theory and Applications
A Scheme for Computing Minimum Covers within Simple Regions
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A theoretical structure for computational geometry: regions of point-free overlapping circles
ISCGAV'09 Proceedings of the 9th WSEAS international conference on Signal processing, computational geometry and artificial vision
3D hyperbolic Voronoi diagrams
Computer-Aided Design
Point location in the continuous-time moving network
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Algorithms and theory of computation handbook
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
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Skew jensen-bregman voronoi diagrams
Transactions on Computational Science XIV
Continuous-time moving network voronoi diagram
Transactions on Computational Science XIV
Tight bound for farthest-color voronoi diagrams of line segments
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Voronoi-like partition of lattice in cellular automata
Mathematical and Computer Modelling: An International Journal
Convex Distance Functions In 3-Space Are Different
Fundamenta Informaticae
Clustering based on a near neighbor graph and a grid cell graph
Journal of Intelligent Information Systems
A note on minimum-sum coverage by aligned disks
Information Processing Letters
| Hi-index | 0.01 |