Guillotine Cut

Ding-Zhu Du (), Ker-I Ko () and Xiaodong Hu ()
Additional contact information
Ding-Zhu Du: University of Texas at Dallas
Ker-I Ko: State University of New York at Stony Brook
Xiaodong Hu: Academy of Mathematics and Systems Science Chinese Academy of Sciences

Chapter 5 in Design and Analysis of Approximation Algorithms, 2012, pp 165-209 from Springer

Abstract: Abstract Guillotine cut is a technique of adaptive partition that has found interesting applications in many geometric problems. Roughly speaking, a guillotine cut is a subdivision by a straight line that partitions a given area into at least two subareas. By a sequence of guillotine cut operations, we can partition the input area into smaller areas, solve the subproblems in these smaller areas, and combine these solutions to obtain a feasible solution to the original input.

Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-1701-9_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461417019

DOI: 10.1007/978-1-4614-1701-9_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().