Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 24,59
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 24,56
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Forgotten Books, London, Reino Unido
EUR 15,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. Print on Demand. This book presents a simple algorithm for constructing a Delaunay triangulation, a specialized division of a set of points into triangles, for a finite set of points in a two-dimensional plane constrained by a finite collection of line segments. The algorithm first constructs a Delaunay triangulation for the set and then generates a sequence of triangulations as each line segment is incorporated into the previously obtained triangulation. The algorithm has been shown to operate in linear time for a fixed number of line segments, making it a valuable tool for applications where efficiency is a critical factor. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.