MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS

DOI10.1142/S0218195909002824zbMath1173.65012OpenAlexW2159443343MaRDI QIDQ3628100

Ovidiu Daescu, James Dean Palmer

Publication date: 19 May 2009

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195909002824

zbMATH Keywords

approximation algorithmweighted regionpolynomial timeminimum separationoptimal link problemoptimal penetration problemweighted subdivision

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Line Facility Location in Weighted Regions ⋮ Line facility location in weighted regions ⋮ Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications ⋮ Line Segment Facility Location in Weighted Subdivisions ⋮ Geometric optimization and sums of algebraic functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding an approximate minimum-link visibility path inside a simple polygon
• A computational solution of the inverse problem in radiation-therapy treatment planning
• Topologically sweeping an arrangement
• Stock cutting to minimize cutting length
• Computing optimal beams in two and three dimensions
• Minimal link visibility paths inside a simple polygon
• An optimal algorithm for intersecting line segments in the plane
• The weighted region problem
• WALKING IN AN ARRANGEMENT TOPOLOGICALLY
• Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
• Determining an optimal penetration among weighted regions in two and three dimensions
• Approximating shortest paths on weighted polyhedral surfaces
• Computing the optimal bridge between two polygons

This page was built for publication: MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS