Halfspace Range Search: An Algorithmic Application of k-Sets

Given a fixed set <italic>S</italic> of <italic>n</italic> points in <italic>E</italic><supscrpt>3</supscrpt> and a query plane π, the halfspace range search problem asks for the retrieval of all points of <italic>S</italic> on a chosen side of π. We prove that with <italic>&Ogr;</italic>(<italic>n</italic>(log <italic>n</italic>)<supscrpt>3</supscrpt>(log… CONTINUE READING



Citations per Year

66 Citations

Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.