Excerpt from Partitioning Arrangements of Lines: I. An Efficient Deterministic Algorithm Implicit point location problem: Given a collection of m points and a collection Of (possibly intersecting) n triangles in the plane, find which points lie in the union of the triangles. This turns out to be a special case of a general problem of implicit point location of planar maps formed by overlapping figures. We present a deterministic algorithm with O(m2/3n2/3 log3 n (m n) log n) time complexity. Approximate half-plane range ...
Read More
Excerpt from Partitioning Arrangements of Lines: I. An Efficient Deterministic Algorithm Implicit point location problem: Given a collection of m points and a collection Of (possibly intersecting) n triangles in the plane, find which points lie in the union of the triangles. This turns out to be a special case of a general problem of implicit point location of planar maps formed by overlapping figures. We present a deterministic algorithm with O(m2/3n2/3 log3 n (m n) log n) time complexity. Approximate half-plane range query: Given a set S of n points in the plane and a parameter (not necessarily constant) e 0, preprocess them so that, for any query line 2, we can approximately count the number of points lying above 8 with an error of at most i: en. We give an algorithm that preprocesses S, in time O(% log n log f), into a data structure of size O(f), so that a query can be answered in C(log n) time. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at ... This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Read Less
Add this copy of Partitioning Arrangements of Lines I an Efficient to cart. $13.19, new condition, Sold by Books2anywhere rated 5.0 out of 5 stars, ships from Fairford, GLOUCESTERSHIRE, UNITED KINGDOM, published 2018 by Forgotten Books.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.
Add this copy of Partitioning Arrangements of Lines I an Efficient to cart. $14.05, new condition, Sold by Paperbackshop International rated 2.0 out of 5 stars, ships from Fairford, GLOS, UNITED KINGDOM, published 2018 by Forgotten Books.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.
Add this copy of Partitioning Arrangements of Lines I an Efficient to cart. $21.53, new condition, Sold by Paperbackshop rated 4.0 out of 5 stars, ships from Bensenville, IL, UNITED STATES, published 2018 by Forgotten Books.
