Dominance for enclosure problems

Two triangles in the plane are called homothetic if one can be obtained from the other using scaling and translation operations. In this paper, we investigate an enclosure problem involving homothetic triangles. Specifically, the problem is to preprocess a given set of n homothetic triangles so that...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of combinatorial optimization Ročník 50; číslo 4; s. 41
Hlavní autoři: Akram, Waseem, Saxena, Sanjeev
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2025
Springer Nature B.V
Témata:
ISSN:1382-6905, 1573-2886
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Two triangles in the plane are called homothetic if one can be obtained from the other using scaling and translation operations. In this paper, we investigate an enclosure problem involving homothetic triangles. Specifically, the problem is to preprocess a given set of n homothetic triangles so that the triangles enclosing (or containing) a query object can be found quickly. The query objects we consider include points, line segments, trapezoids, and ellipses. We propose an efficient solution to the problem using the 3-D dominance searching. Our results can also be extended to higher dimensions. Moreover, we also present a negative result that suggests that the enclosure problem involving (arbitrarily) axis-parallel right-angled triangles may not be solvable using 4-D dominance searching.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-025-01373-5