Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Properties of local coordinates based on Dirichlet tessellations
Geometric modelling
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Voronoi diagrams and Delaunay triangulations
Handbook of discrete and computational geometry
Proceedings of the eighteenth annual symposium on Computational geometry
Competitive Facility Location along a Highway
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On finding a guard that sees most and a shop that sells most
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The one-round Voronoi game replayed
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Maximum Neighbour Voronoi Games
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
The one-round Voronoi game replayed
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
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
| Hi-index | 0.00 |
Given a set S of s points in the plane, where do we place a new point, p, in order to maximize the area of its region in the Voronoi diagram of S and p? We study the case where the Voronoi neighbors of p are in convex position, and prove that there is at most one local maximum.