Spanning trees crossing few barriers

Authors:
Tetsuo Asano;Mark de Berg;Otfried Cheong;Leonidas J. Guibas;Jack Snoeyink;Hisao Tamaki
Affiliations:
Japan Advanced Institute of Science and Technology, Asahidai, Tatsunokuchi, Ishikawa, 923-1292 Japan;Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, the Netherlands;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Department of Computer Science, Stanford University, Stanford, CA;Department of Computer Science, University of British Columbia, Vancouver, Canada;Department of Computer Science, Meiji University, Higaahi-Mita, Tama-ku, Kawasaki, 214 Japan
Venue:
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Year:
1999

Optimal point location in a monotone subdivision

SIAM Journal on Computing
Efficient binary space partitions for hidden-surface removal and solid modeling

Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
On the optimal binary plane partition for sets of isothetic rectangles

Information Processing Letters
Realistic input models for geometric algorithms

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Linear-Time Reconstruction of Delaunay Triangulations with Applications

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms

Online point location in planar arrangements and its applications

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Hi-index	0.00