A simple entropy-based algorithm for planar point location
From MaRDI portal
Publication:2944554
DOI10.1145/1240233.1240240zbMath1321.68429MaRDI QIDQ2944554
Sunil Arya, Theocharis Malamatos, David M. Mount
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: http://repository.ust.hk/ir/bitstream/1783.1-3136/1/simple.pdf
entropy; randomized algorithms; point location; expected-case complexity; polygonal subdivision; trapezoidal maps
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
68W20: Randomized algorithms
Related Items
Adaptive Point Location in Planar Convex Subdivisions, Distance-sensitive planar point location, Lower bounds for expected-case planar point location, Practical distribution-sensitive point location in triangulations