包含问题的支配性
Dominance for Containment Problems
AI总结:
针对输入为位似三角形、查询为特定几何对象的包含问题,提出利用三维查询支配性问题解决,并可扩展到更高维度,实现高效预处理与查询。
摘要:
在包含问题中,目标是预处理一组几何对象,以便在给定几何查询对象时,能报告所有包含该查询对象的对象。我们考虑输入对象为位似三角形、查询对象为线段、圆以及底边平行于坐标轴的梯形的包含问题。我们证明该问题可通过三维查询支配性问题解决,所提出的解决方案还可扩展到更高维度。
英文摘要:
In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. We consider the containment problem where input objects are homothetic triangles and the query objects considered are line segments, circles, and trapezoids with bases parallel to either axis. We show that this problem can be solved using the 3-d query dominance problem. The solutions presented can also be extended for higher dimensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。