Minimum separation in weighted subdivisions

Ovidiu Daescu, James D Palmer

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We present polynomial time results for computing a minimum separation between two regions in a planar weighted subdivision. Our results are based on a (more general) theorem that characterizes a class of functions for which optimal solutions arise on the boundary of the feasible domain. A direct consequence of this theorem is that a minimum separation goes through a vertex of the weighted subdivision. We also consider extensions and present results for the 3-D case and for a more general case of the 2-D separation problem, in which the separation (link) has associated an ε-width. Our results are the first nontrivial upper bounds for these problems. We also discuss simple approximation algorithms for the 2-D case and present a prune-and-search approach that can be used with either the continuous or the approximate solutions to speed up the computation. We have implemented a variant of the two region minimum separation algorithm based on the prune-and-search scheme.

Original languageEnglish (US)
Pages (from-to)33-57
Number of pages25
JournalInternational Journal of Computational Geometry and Applications
Volume19
Issue number1
DOIs
StatePublished - Feb 2009
Externally publishedYes

Fingerprint

Subdivision
Approximation algorithms
Theorem
3D
Approximation Algorithms
Polynomial time
Approximate Solution
Speedup
Optimal Solution
Polynomials
Upper bound
Computing
Vertex of a graph

Keywords

  • Approximation algorithm
  • Minimum separation
  • Polynomial time
  • Weighted region

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics
  • Geometry and Topology
  • Computational Mathematics

Cite this

Minimum separation in weighted subdivisions. / Daescu, Ovidiu; Palmer, James D.

In: International Journal of Computational Geometry and Applications, Vol. 19, No. 1, 02.2009, p. 33-57.

Research output: Contribution to journalArticle

@article{fb657f64cc4b403fb775adb698bd5358,
title = "Minimum separation in weighted subdivisions",
abstract = "We present polynomial time results for computing a minimum separation between two regions in a planar weighted subdivision. Our results are based on a (more general) theorem that characterizes a class of functions for which optimal solutions arise on the boundary of the feasible domain. A direct consequence of this theorem is that a minimum separation goes through a vertex of the weighted subdivision. We also consider extensions and present results for the 3-D case and for a more general case of the 2-D separation problem, in which the separation (link) has associated an ε-width. Our results are the first nontrivial upper bounds for these problems. We also discuss simple approximation algorithms for the 2-D case and present a prune-and-search approach that can be used with either the continuous or the approximate solutions to speed up the computation. We have implemented a variant of the two region minimum separation algorithm based on the prune-and-search scheme.",
keywords = "Approximation algorithm, Minimum separation, Polynomial time, Weighted region",
author = "Ovidiu Daescu and Palmer, {James D}",
year = "2009",
month = "2",
doi = "10.1142/S0218195909002824",
language = "English (US)",
volume = "19",
pages = "33--57",
journal = "International Journal of Computational Geometry and Applications",
issn = "0218-1959",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

TY - JOUR

T1 - Minimum separation in weighted subdivisions

AU - Daescu, Ovidiu

AU - Palmer, James D

PY - 2009/2

Y1 - 2009/2

N2 - We present polynomial time results for computing a minimum separation between two regions in a planar weighted subdivision. Our results are based on a (more general) theorem that characterizes a class of functions for which optimal solutions arise on the boundary of the feasible domain. A direct consequence of this theorem is that a minimum separation goes through a vertex of the weighted subdivision. We also consider extensions and present results for the 3-D case and for a more general case of the 2-D separation problem, in which the separation (link) has associated an ε-width. Our results are the first nontrivial upper bounds for these problems. We also discuss simple approximation algorithms for the 2-D case and present a prune-and-search approach that can be used with either the continuous or the approximate solutions to speed up the computation. We have implemented a variant of the two region minimum separation algorithm based on the prune-and-search scheme.

AB - We present polynomial time results for computing a minimum separation between two regions in a planar weighted subdivision. Our results are based on a (more general) theorem that characterizes a class of functions for which optimal solutions arise on the boundary of the feasible domain. A direct consequence of this theorem is that a minimum separation goes through a vertex of the weighted subdivision. We also consider extensions and present results for the 3-D case and for a more general case of the 2-D separation problem, in which the separation (link) has associated an ε-width. Our results are the first nontrivial upper bounds for these problems. We also discuss simple approximation algorithms for the 2-D case and present a prune-and-search approach that can be used with either the continuous or the approximate solutions to speed up the computation. We have implemented a variant of the two region minimum separation algorithm based on the prune-and-search scheme.

KW - Approximation algorithm

KW - Minimum separation

KW - Polynomial time

KW - Weighted region

UR - http://www.scopus.com/inward/record.url?scp=65249138209&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=65249138209&partnerID=8YFLogxK

U2 - 10.1142/S0218195909002824

DO - 10.1142/S0218195909002824

M3 - Article

AN - SCOPUS:65249138209

VL - 19

SP - 33

EP - 57

JO - International Journal of Computational Geometry and Applications

JF - International Journal of Computational Geometry and Applications

SN - 0218-1959

IS - 1

ER -