Handbook of Discrete and Computational Geometry About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient algorithms norâ€¦ (More)

We derive a lower bound of (n) for the halfspace emptiness problem: Given a set of n points and n hyperplanes in IR, is every point above every hyperplane? This matches the best known upper bound toâ€¦ (More)

Preliminary evidence suggests that fetal movement in response to vibrotactile stimulation "habituates" with repeated exposure. If demonstrated in fetuses, the habituation paradigm may be useful as aâ€¦ (More)

A method of specifying input combinations for latchup testing of bipolar LSI devices is described, which is based on the fact that certain block structures are repeated throughout the device. Withâ€¦ (More)

We show how to preprocess a set S of points in R into an external memory data structure that e ciently supports linear-constraint queries. Each query is in the form of a linear constraint xd a0+ Pd 1â€¦ (More)