Determining an optimal penetration among weighted regions in two and three dimensions

Authors:
Danny Z. Chen;Ovidiu Daescu;Xiaobo (Sharon) Hu;Xiaodong Wu;Jinhui Xu
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN
Venue:
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Year:
1999

Computational geometry: an introduction

Computational geometry: an introduction
A computational solution of the inverse problem in radiation-therapy treatment planning

Applied Mathematics and Computation
Topologically sweeping an arrangement

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Topological sweeping in three dimensions

SIGAL '90 Proceedings of the international symposium on Algorithms
The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
The visibility complex

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating weighted shortest paths on polyhedral surfaces

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
The 3D visibility complex: a new approach to the problems of accurate visibility

Proceedings of the eurographics workshop on Rendering techniques '96
Robot Motion Planning

Robot Motion Planning
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces

SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory

Optimizing the sum of linear fractional functions and applications

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Parallel Optimal Weighted Links

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Optimal Beam Penetrations in Two and Three Dimensions

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Topological Peeling and Implementation

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Experimental Study and Comparison of Topological Peeling and Topological Walk

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Geometric tomography: a limited-view approach for computed tomography

Proceedings of the twenty-fifth annual symposium on Computational geometry
Traveling salesman problem of segments

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Hi-index	0.00