@book{citeulike:2782334,
	author = {Latombe, Jean-Claude  },
	citeulike-article-id = {2782334},
	howpublished = {Hardcover},
	isbn = {0792391292},
	keywords = {visilibity},
	month = {December},
	posted-at = {2008-05-10 05:12:54},
	priority = {2},
	publisher = {Springer},
	title = {Robot Motion Planning (The Springer International Series in Engineering and Computer Science)},
	url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/0792391292},
	year = {1990}
}



@book{citeulike:2665129,
	address = {San Diego, CA, USA},
	citeulike-article-id = {2665129},
	editor = {Ullrich, Christian  },
	isbn = {012708245X},
	keywords = {visilibity},
	posted-at = {2008-04-14 04:05:13},
	priority = {2},
	publisher = {Academic Press Professional, Inc.},
	title = {Computer arithmetic and self-validating numerical methods},
	url = {http://portal.acm.org/citation.cfm?id=120387},
	year = {1990}
}



@inproceedings{citeulike:2665127,
	address = {New York, NY, USA},
	author = {Salesin, D.  and Stolfi, J.  and Guibas, L. },
	booktitle = {SCG '89: Proceedings of the fifth annual symposium on Computational geometry},
	citeulike-article-id = {2665127},
	doi = {10.1145/73833.73857},
	isbn = {0897913183},
	keywords = {visilibity},
	pages = {208--217},
	posted-at = {2008-04-14 04:04:45},
	priority = {2},
	publisher = {ACM},
	title = {Epsilon geometry: building robust algorithms from imprecise computations},
	url = {http://portal.acm.org/citation.cfm?id=73833.73857},
	year = {1989}
}



@inproceedings{citeulike:2665126,
	address = {New York, NY, USA},
	author = {Segal, Mark  },
	booktitle = {SIGGRAPH '90: Proceedings of the 17th annual conference on Computer graphics and interactive techniques},
	citeulike-article-id = {2665126},
	doi = {10.1145/97879.97891},
	isbn = {0201509334},
	keywords = {visilibity},
	pages = {105--114},
	posted-at = {2008-04-14 04:04:15},
	priority = {2},
	publisher = {ACM},
	title = {Using tolerances to guarantee valid polyhedral modeling results},
	url = {http://portal.acm.org/citation.cfm?id=97891},
	year = {1990}
}



@article{citeulike:2665125,
	address = {San Diego, CA, USA},
	author = {Fortune, Steven  },
	citeulike-article-id = {2665125},
	isbn = {0124386601},
	keywords = {visilibity},
	pages = {189--192},
	posted-at = {2008-04-14 04:03:44},
	priority = {2},
	publisher = {Academic Press Professional, Inc.},
	title = {Numerical stability of geometric algorithms},
	url = {http://portal.acm.org/citation.cfm?id=114172.114203},
	year = {1991}
}



@inproceedings{citeulike:2665124,
	address = {New York, NY, USA},
	author = {Segal, Mark   and S\'equin, Carlo  H. },
	booktitle = {SCG '85: Proceedings of the first annual symposium on Computational geometry},
	citeulike-article-id = {2665124},
	doi = {10.1145/323233.323238},
	isbn = {0897911636},
	keywords = {visilibity},
	pages = {29--38},
	posted-at = {2008-04-14 04:03:22},
	priority = {2},
	publisher = {ACM},
	title = {Consistent calculations for solids modeling},
	url = {http://portal.acm.org/citation.cfm?id=323233.323238},
	year = {1985}
}



@inproceedings{citeulike:2555174,
	abstract = {This paper describes a general-purpose programming technique, called the Simulation of
Simplicity, which can be used to cope with degenerate input data for geometric algorithms.
It relieves the programmer from the task to provide a consistent treatment for every single
special case that can occur. The programs that use the technique tend to be considerably
smaller and more robust than those that do not use it. We believe that this technique will
become a standard tool in writing geometric...},
	author = {Edelsbrunner, Herbert   and Mucke, Ernst  P. },
	booktitle = {Symposium on Computational Geometry},
	citeulike-article-id = {2555174},
	keywords = {visilibity},
	pages = {118--133},
	posted-at = {2008-03-19 03:48:10},
	priority = {0},
	title = {Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms},
	url = {http://citeseer.ist.psu.edu/edelsbrunner90simulation.html},
	year = {1988}
}



@article{citeulike:2554259,
	address = {New York, NY, USA},
	author = {Erdem, U\vgur  M.  and Sclaroff, Stan  },
	citeulike-article-id = {2554259},
	doi = {10.1016/j.cviu.2006.06.005},
	issn = {1077-3142},
	journal = {Comput. Vis. Image Underst.},
	keywords = {visilibity},
	month = {September},
	number = {3},
	pages = {156--169},
	posted-at = {2008-03-19 03:45:31},
	priority = {0},
	publisher = {Elsevier Science Inc.},
	title = {Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements},
	url = {http://portal.acm.org/citation.cfm?id=1167665},
	volume = {103},
	year = {2006}
}



@article{citeulike:620342,
	address = {New York, NY, USA},
	author = {Goldberg, David  },
	citeulike-article-id = {620342},
	doi = {10.1145/103162.103163},
	issn = {0360-0300},
	journal = {ACM Comput. Surv.},
	keywords = {visilibity},
	month = {March},
	number = {1},
	pages = {5--48},
	posted-at = {2008-03-19 03:34:10},
	priority = {0},
	publisher = {ACM Press},
	title = {What every computer scientist should know about floating-point arithmetic},
	url = {http://portal.acm.org/citation.cfm?id=103163},
	volume = {23},
	year = {1991}
}



@book{citeulike:2553931,
	abstract = {{A human observer can effortlessly identify visible portions of geometric objects present in the environment. However, computations of visible portions of objects from a viewpoint involving thousands of objects is a time consuming task even for high speed computers. To solve such visibility problems, efficient algorithms have been designed. This book presents some of these visibility algorithms in two dimensions. Specifically, basic algorithms for point visibility, weak visibility, shortest paths, visibility graphs, link paths and visibility queries are all discussed. Several geometric properties are also established through lemmas and theorems. With over 300 figures and hundreds of exercises, this book is ideal for graduate students and researchers in the field of computational geometry.  It will also be useful as a reference for researchers working in algorithms, robotics, computer graphics and geometric graph theory, and some algorithms from the book can be used in a first course in computational geometry.}},
	author = {Ghosh, Subir  K. },
	citeulike-article-id = {2553931},
	howpublished = {Hardcover},
	isbn = {0521875749},
	keywords = {visilibity},
	month = {April},
	posted-at = {2008-03-19 03:19:10},
	priority = {0},
	publisher = {{Cambridge University Press}},
	title = {Visibility Algorithms in the Plane},
	url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/0521875749},
	year = {2007}
}



@book{citeulike:2296138,
	author = {O'Rourke}, J. {},
	citeulike-article-id = {2296138},
	keywords = {visilibity},
	posted-at = {2008-03-19 03:18:06},
	priority = {0},
	publisher = {Oxford University Press},
	title = {Art Gallery Theorems and Algorithms},
	year = {1987}
}



@book{citeulike:2004221,
	address = {Amsterdam, The Netherlands, The Netherlands},
	author = {Sack, J. R.  and Urrutia, J. },
	citeulike-article-id = {2004221},
	keywords = {visilibity},
	posted-at = {2008-03-19 03:16:33},
	priority = {0},
	publisher = {North-Holland Publishing Co.},
	title = {Handbook of Computational Geometry},
	year = {2000}
}



@book{citeulike:602537,
	abstract = {This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For students this motivation will be especially welcome. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement. All the basic techniques and topics from computational geometry, as well as several more advanced topics, are covered. The book is largely self-contained and can be used for self-study by anyone with a basic background in algorithms. In the second edition, besides revisions to the first edition, a number of new exercises have been added.},
	author = {de Berg, Mark   and van Kreveld, Marc   and Overmars, Mark   and Schwarzkopf, Otfried  },
	citeulike-article-id = {602537},
	howpublished = {Hardcover},
	isbn = {3540656200},
	keywords = {visilibity},
	month = {February},
	posted-at = {2008-03-19 03:15:24},
	priority = {0},
	publisher = {Springer},
	title = {Computational Geometry},
	url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/3540656200},
	year = {2000}
}



@book{citeulike:2341702,
	abstract = {This is the newly revised and expanded edition of the popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new "Sources" chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The code in this new edition is significantly improved from the first edition, and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.},
	author = {O'Rourke, Joseph  },
	citeulike-article-id = {2341702},
	howpublished = {Hardcover},
	isbn = {0521640105},
	keywords = {visilibity},
	month = {October},
	posted-at = {2008-03-19 03:14:07},
	priority = {2},
	publisher = {Cambridge University Press},
	title = {Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)},
	url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/0521640105},
	year = {1998}
}