#### Filter Results:

- Full text PDF available (192)

#### Publication Year

1987

2017

- This year (9)
- Last 5 years (74)
- Last 10 years (125)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical. The authors present rigorous… (More)

Euclidean spanners are important data structures in geometric algorithm design, because they provide a means of approximating the complete Euclidean graph with only O(n) edges, so that the shortest path length between each pair of points is not more than a constant factor longer than the Euclidean distance between the points. In many applications of… (More)

- Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
- J. Algorithms
- 1993

In a generalized intersection searching problem, a set, S, of colored geometrie objects is to be preprocessed so that given some query object, q, the distinct colors of the objects intersected by q can be reported efficiently or the number of such colors can be counted effi.ciently. In the dynamic setting, colored objects can be inserted into or de1eted… (More)

- Giri Narasimhan, Michiel H. M. Smid
- SIAM J. Comput.
- 2000

There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in which distances between vertices in G are at most t times the Euclidean distances between them; in other words, distances in G are “stretched” by a factor of at most t. We consider… (More)

- Sunil Arya, David M. Mount, Michiel H. M. Smid
- FOCS
- 1994

Let S be a set of n points in IR and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and q. Such a path is called a t-spanner path. The spanner diameter of such a spanner is… (More)

- Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
- Algorithmica
- 2002

Given a set S of n points in the plane, we give an O(n log n)-time algorithm that constructs a plane t-spanner for S, with t ≈ 10, such that the degree of each point of S is bounded from above by 27, and the total edge length is proportional to the weight of a minimum spanning tree of S. Previously, no algorithms were known for constructing plane t-spanners… (More)

- Sunil Arya, Michiel H. M. Smid
- Algorithmica
- 1994

LetS be a set ofn points in ℝ d and lett>1 be a real number. At-spanner forS is a graph having the points ofS as its vertices such that for any pairp, q of points there is a path between them of length at mostt times the Euclidean distance betweenp andq. An efficient implementation of a greedy algorithm is given that constructs at-spanner having bounded… (More)

- Danny Krizanc, Pat Morin, Michiel H. M. Smid
- Nord. J. Comput.
- 2003

We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequence of labels on the path from u to v.

- Prosenjit Bose, Hua Guo, +5 authors Yihui Tang
- Inf. Process. Lett.
- 2008

Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed the probability of such erroneous answers, called the false-positive rate, and Bloom’s analysis has appeared in many publications throughout the years. We show that… (More)

- Hans-Peter Lenhof, Michiel H. M. Smid
- Int. J. Comput. Geometry Appl.
- 1995