Richard Pollack

Publication Activity (10 Years)

Years Active: 1980-2009
Publications (10 Years): 0

Publications

Saugata Basu, Richard Pollack, Marie-Françoise Roy
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions. Comb. 29 (5) (2009)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
Computing the First Betti Number of a Semi-Algebraic Set. Found. Comput. Math. 8 (1) (2008)
Jacob E. Goodman, János Pach, Richard Pollack
Foreword. Discret. Comput. Geom. 39 (1-3) (2008)
Jacob E. Goodman, Richard Pollack
The combinatorial encoding of disjoint convex sets in the plane. Comb. 28 (1) (2008)
Raghavan Dhandapani, Jacob E. Goodman, Andreas F. Holmsen, Richard Pollack, Shakhar Smorodinsky
Convexity in Topological Affine Planes. Discret. Comput. Geom. 38 (2) (2007)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets CoRR (2006)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
An asymptotically tight bound on the number of connected components of realizable sign conditions CoRR (2006)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
Computing the euler-poincaré characteristics of sign conditions. Comput. Complex. 14 (1) (2005)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
Computing the first Betti number and the connected components of semi-algebraic sets. STOC (2005)
Jacob E. Goodman, Richard Pollack
Editorial Note. Discret. Comput. Geom. 33 (1) (2005)
Saugata Basu, Raghavan Dhandapani, Richard Pollack
. Graph Drawing (2004)
Boris Aronov, Jacob E. Goodman, Richard Pollack
A Helly-type theorem for higher-dimensional transversals. Comput. Geom. 21 (3) (2002)
Pankaj K. Agarwal, Dan Halperin, Richard Pollack
Guest Editors' Foreword. Discret. Comput. Geom. 25 (4) (2001)
Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. Discret. Comput. Geom. 25 (4) (2001)
Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
On the Helly Number for Hyperplane Transversals to Unit Balls. Discret. Comput. Geom. 24 (2-3) (2000)
Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
A Helly-type theorem for hyperplane transversals to well-separated convex sets. SCG (2000)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set. ISSAC (1998)
Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
Quasi-Planar Graphs Have a Linear Number of Edges. Comb. 17 (1) (1997)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety. J. Complex. 13 (1) (1997)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract). STOC (1996)
Jacob E. Goodman, Richard Pollack, Rephael Wenger
Bounding the Number of Geometric Permutations Induced byk-Transversals. J. Comb. Theory, Ser. A 75 (2) (1996)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
On the Combinatorial and Algebraic Complexity of Quantifier Elimination. J. ACM 43 (6) (1996)
Jacob E. Goodman, Richard Pollack, Rephael Wenger
On the Connected Components of the Space of Line Transersals t a Family of Convex Sets. Discret. Comput. Geom. 13 (1995)
Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
Quasi-Planar Graphs Have a Linear Number of Edges. Graph Drawing (1995)
Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu
Every Arrangement Extends to a Spread. Comb. 14 (3) (1994)
Saugata Basu, Richard Pollack, Marie-Françoise Roy
On the Combinatorial and Algebraic Complexity of Quantifier Elimination FOCS (1994)
Jacob E. Goodman, Richard Pollack, Rephael Wenger
-Transversals. SCG (1994)
János Pach, Richard Pollack, Emo Welzl
Weaving Patterns of Lines and Line Segments in Space. Algorithmica 9 (6) (1993)
Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. 92 (2) (1992)
Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu
There is a Universal Topological Plane. SCG (1992)
Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. 1 (1991)
Jacob E. Goodman, Richard Pollack
The complexity of point configurations. Discret. Appl. Math. 31 (2) (1991)
Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger
The Combinatorial Complexity of Hyperplane Transversals. SCG (1990)
Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
Counting and Cutting Cycles of Lines and Rods in Space FOCS (1990)
János Pach, Richard Pollack, Emo Welzl
Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms (1990)
Imre Bárány, Jacob E. Goodman, Richard Pollack
Do Projections Go to Infinity? Applied Geometry And Discrete Mathematics (1990)
Hubert de Fraysseix, János Pach, Richard Pollack
How to draw a planar graph on a grid. Comb. 10 (1) (1990)
Richard Pollack, Rephael Wenger
Necessary and sufficient conditions for hyperplane transversals. Comb. 10 (3) (1990)
Richard Pollack, Micha Sharir, Günter Rote
Computing the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 4 (1989)
Jacob E. Goodman, Richard Pollack, Bernd Sturmfels
Coordinate Representation of Order Types Requires Exponential Storage STOC (1989)
Richard Pollack, Rephael Wenger
Necessary and Sufficient Conditions for Hyperplane Transversals. SCG (1989)
Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza
Radius, diameter, and minimum degree. J. Comb. Theory, Ser. B 47 (1) (1989)
Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. 4 (1989)
Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG (1988)
William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3 (1988)
Hubert de Fraysseix, János Pach, Richard Pollack
Small Sets Supporting Fáry Embeddings of Planar Graphs STOC (1988)
Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP (1988)
William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
Computing the Link Center of a Simple Polygon. SCG (1987)
Jacob E. Goodman, Richard Pollack
Preface. Discret. Math. 60 (1986)
Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony
Geometric Applications of Davenport-Schinzel Sequences FOCS (1986)
Jacob E. Goodman, Richard Pollack
. Discret. Comput. Geom. 1 (1986)
Jacob E. Goodman, Richard Pollack
Modeling planar configurations. SCG (1985)
Richard Pollack
Increasing the Minimum Distance of a Set of Points. J. Comb. Theory, Ser. A 40 (2) (1985)
Jacob E. Goodman, Richard Pollack
On the Number of k-Subsets of a Set of n Points in the Plane. J. Comb. Theory, Ser. A 36 (1) (1984)
Jacob E. Goodman, Richard Pollack
Semispaces of Configurations, Cell Complexes of Arrangements. J. Comb. Theory, Ser. A 37 (3) (1984)
Jacob E. Goodman, Richard Pollack
Multidimensional Sorting. SIAM J. Comput. 12 (3) (1983)
Jacob E. Goodman, Richard Pollack
. J. Comb. Theory, Ser. A 32 (1) (1982)
Jacob E. Goodman, Richard Pollack
Three Points Do Not Determine a (Pseudo-) Plane. J. Comb. Theory, Ser. A 31 (2) (1981)
Jacob E. Goodman, Richard Pollack
On the Combinatorial Classification of Nondegenerate Configurations in the Plane. J. Comb. Theory, Ser. A 29 (2) (1980)
Jacob E. Goodman, Richard Pollack
Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines. J. Comb. Theory, Ser. A 29 (3) (1980)