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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1030; s. 115054
Hlavní autori:	Akram, Waseem, Saxena, Sanjeev
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 13.03.2025
Predmet:	Algorithms Data structures Dynamic algorithms Geometric intersection Data structures Algorithms Dynamic algorithms Geometric intersection
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!