This book presents work in two of the most popular
areas of geometric computation: Robust Geometric
Computing and Optimal Visibility Coverage. Both areas
have been extensively researched in recent years and
attracted the attention of many researchers and
software developers. (1) Implementation of geometric
algorithms is generally difficult because one must
deal with both precision problems and degenerate
input. Overlooking these issues often result in
program errors or crashes. The first part of this
book presents algorithms to approximate an
arrangement of line segments, which is a basic...