Isbn: 9781333393366 - partitioning arrangements of lines (classic reprint): i. an efficient deterministic algorithm: i. an efficient deterministic algorithm (classic reprint) (3 risultati)

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: New. Print on Demand. This book tackles the challenge of efficiently partitioning a plane into quadrilaterals, ensuring that each quadrilateral is intersected by no more than a small number of lines and that the overall partitioning produces the fewest possible quadrilaterals. The author presents a deterministic algorithm that achieves these goals in near-optimal time complexity, opening the door for researchers and practitioners to apply this partitioning technique to various geometric problems in computer science. This book provides a valuable contribution to the field and should be of interest to researchers and students in computational geometry, computer graphics, and related areas. 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. …