Point enclosure problem for homothetic polygons

In this paper, we investigate the following problem: “given a set S of n homothetic polygons, preprocess S to efficiently report all the polygons of S containing a query point.” A set of polygons is said to be homothetic if each polygon can be obtained from any other polygon in the set using scaling...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1030; p. 115054
Main Authors:	Akram, Waseem, Saxena, Sanjeev
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 13.03.2025
Subjects:	Algorithms Data structures Dynamic algorithms Geometric intersection Data structures Algorithms Dynamic algorithms Geometric intersection
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!