Convex distance functions in 3-space are different
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On lazy randomized incremental construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal point placement for mesh smoothing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
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
Quickest paths, straight skeletons, and the city Voronoi diagram
Proceedings of the eighteenth annual symposium on Computational geometry
Dynamic Additively Weighted Voronoi Diagrams in 2D
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Abstract Voronoi diagram in 3-space
Journal of Computer and System Sciences
IEEE Transactions on Computers
Abstract Voronoi diagrams revisited
Computational Geometry: Theory and Applications
Shortest paths and voronoi diagrams with transportation networks under general distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Voronoi diagrams with a transportation network on the euclidean plane
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Convex Distance Functions In 3-Space Are Different
Fundamenta Informaticae
On the complexity of higher order abstract voronoi diagrams
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.01 |