Point enclosure problem for homothetic polygons

DOI10.1016/J.TCS.2024.115054MaRDI QIDQ7028339zbMATH OpenFDO

Authors Waseem Akram, Sanjeev Saxena

Publication date 12 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.115054

zbMATH Keywords

data structuresdynamic algorithmsgeometric intersection

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Cites work

• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Algorithms for ray-shooting and intersection searching
• Algorithms for three-dimensional dominance searching in linear space.
• Computational geometry. Algorithms and applications.
• Dominance for enclosure problems
• Dominance made simple
• Dynamic fractional cascading
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• Filtering Search: A New Approach to Query-Answering
• Fractional cascading. I: A data structuring technique
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Linear space data structures for two types of range search
• On \(k\)-sets in arrangements of curves and surfaces
• On point covers of c-oriented polygons
• Orthogonal point location and rectangle stabbing queries in 3-d
• Point enclosure problem for homothetic polygons
• Storing line segments in partition trees
• Triangulating a simple polygon in linear time

Cited in

(1)

• Dominance for enclosure problems

This page was built for publication: Point enclosure problem for homothetic polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028339)