On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
On the union of κ-round objects
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Exact and approximation algorithms for computing optimal fat decompositions
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry CCCG02
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Vertical ray shooting and computing depth orders for fat objects
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the twenty-second annual symposium on Computational geometry
Shortest paths on realistic polyhedra
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Graph Drawing
Decompositions and boundary coverings of non-convex fat polyhedra
Computational Geometry: Theory and Applications
Connect the Dot: Computing Feed-Links with Minimum Dilation
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Dynamic planar point location with sub-logarithmic local updates
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Hi-index | 0.00 |