Quote: fast, inclusion test for 2-d points without computing convex hull; uses octant classification

Quotation Skeleton

This paper presents a new fast algorithm to … points, without computing the convex hull. The algorithm … for each point requires only simple test operations, … the proposed algorithm is faster than other known … [p. 30, Linear programming is about 60% slower] … [p. 26] Our algorithm counts the points inside each … The analysis is also simple, as there are … four, or more, consecutive empty octants .. [p. 27]. no more than two consecutive empty octants … exactly three consecutive empty octants … In this case, it is necessary to carry … [p. 30] The number of query points for which … increases with the size of the point set. …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: computational geometry (20 items)