Closest-Point Queries for Complex Objects | Zendy

Eugene Greene | Zendy; Asish Mukhopadhyay | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Closest-Point Queries for Complex Objects

Author(s) -

Eugene Greene,

Asish Mukhopadhyay

Publication year - 2014

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/978-3-319-09129-7_28

Subject(s) - rectangle , ellipse , line segment , polygon (computer graphics) , regular polygon , computer science , heuristic , boundary (topology) , convex polygon , convex hull , line (geometry) , preprocessor , point (geometry) , object (grammar) , computational geometry , simple polygon , algorithm , set (abstract data type) , combinatorics , mathematics , artificial intelligence , geometry , telecommunications , mathematical analysis , frame (networking) , programming language

In this paper we report on the implementation of a heuristic for computing the closest of a set of n given points in the plane to a complex query object, to wit a triangle, a circle, a rectangle etc. Our results indicate that the heuristic is efiective for query objects with small perimeter relative to the given point set, and large values of n.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research