Computational Geometry

Stan Wagon ()
Additional contact information
Stan Wagon: Macalester College, Department of Mathematics and Computer Science

Chapter 15 in Mathematica in Action, 2010, pp 399-422 from Springer

Abstract: Abstract Can a room in 3-space be designed so that a small person can find a hiding place that is invisible from guards located at every vertex of the room? Such a two-dimensional polygon cannot exist. But the image shows a three-dimensional room that does contain such a hiding place. The roof of the room has been removed so we can see inside: there are six ducts that come in from a wall almost to the opposite wall and the hiding place is the red dot in the central cubicle that is almost sealed off by the ducts.

Keywords: Computational Geometry; Steiner Tree; Signed Area; Steiner Point; Hiding Place (search for similar items in EconPapers)
Date: 2010
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:sprchp:978-0-387-75477-2_16

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

DOI: 10.1007/978-0-387-75477-2_16

Access Statistics for this chapter

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