Sciweavers

384 search results - page 26 / 77
» The Number of Generalized Balanced Lines
Sort
View
EUROCRYPT
2001
Springer
14 years 28 days ago
Priced Oblivious Transfer: How to Sell Digital Goods
Abstract. We consider the question of protecting the privacy of customers buying digital goods. More specifically, our goal is to allow a buyer to purchase digital goods from a ve...
William Aiello, Yuval Ishai, Omer Reingold
COMPGEOM
2004
ACM
14 years 1 months ago
Separating point sets in polygonal environments
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
FOCS
1999
IEEE
14 years 23 days ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
13 years 12 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
13 years 9 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian