Efficient computation of location depth contours by methods of computational geometry
✍ Scribed by Kim Miller; Suneeta Ramaswami; Peter Rousseeuw; J. Antoni Sellarès; Diane Souvaine; Ileana Streinu; Anja Struyf
- Book ID
- 110432770
- Publisher
- Springer US
- Year
- 2003
- Tongue
- English
- Weight
- 177 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0960-3174
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The accurate computation of periodic orbits of nonlinear mappings and the precise knowledge of their properties are very important for studying the behavior of many dynamical systems of physical interest. In this paper, we present an efficient numerical method for locating and computing to any desir
Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry. The first part of the book studies classical problems
The author defines “Geometric Algebra Computing” as the geometrically intuitive development of algorithms using geometric algebra with a focus on their efficient implementation, and the goal of this book is to lay the foundations for the widespread use of geometric algebra as a powerful, intuitive m