Ricky Pollack

Ricky Pollack

Discret. Comput. Geom., 2010

2009

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions.

[BibT_eX]

[DOI]

Comb., 2009

2008

Computing the First Betti Number of a Semi-Algebraic Set.

[BibT_eX]

[DOI]

Found. Comput. Math., 2008

Allowable double-permutation sequences and double pseudoline arrangements.

[BibT_eX]

[DOI]

Ricky Pollack

Electron. Notes Discret. Math., 2008

Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

The combinatorial encoding of disjoint convex sets in the plane.

[BibT_eX]

[DOI]

Comb., 2008

2007

Convexity in Topological Affine Planes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

2006

An asymptotically tight bound on the number of connected components of realizable sign conditions

[BibT_eX]

[DOI]

CoRR, 2006

Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets

[BibT_eX]

[DOI]

CoRR, 2006

2005

Editorial Note.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Computing the euler-poincaré characteristics of sign conditions.

[BibT_eX]

[DOI]

Comput. Complex., 2005

Computing the first Betti number and the connected components of semi-algebraic sets.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004

On the Realizable Weaving Patterns of Polynomial Curves in R3.

[BibT_eX]

[DOI]

Raghavan Dhandapani

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2002

A Helly-type theorem for higher-dimensional transversals.

[BibT_eX]

[DOI]

Boris Aronov

Comput. Geom., 2002

2001

A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Dan Halperin

Discret. Comput. Geom., 2001

2000

On the Helly Number for Hyperplane Transversals to Unit Balls.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2000

1998

Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set.

[BibT_eX]

[DOI]

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997

On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety.

[BibT_eX]

[DOI]

J. Complex., 1997

Quasi-Planar Graphs Have a Linear Number of Edges.

[BibT_eX]

[DOI]

Comb., 1997

1996

Bounding the Number of Geometric Permutations Induced byk-Transversals.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1996

On the Combinatorial and Algebraic Complexity of Quantifier Elimination.

[BibT_eX]

[DOI]

J. ACM, 1996

Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

On the Connected Components of the Space of Line Transersals t a Family of Convex Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

1994

Every Arrangement Extends to a Spread.

[BibT_eX]

[DOI]

Comb., 1994

Bounding the Number of Geometric Permutations Induced by k-Transversals.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

Weaving Patterns of Lines and Line Segments in Space.

[BibT_eX]

[DOI]

Emo Welzl

Algorithmica, 1993

1992

Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

There is a Universal Topological Plane.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

The complexity of point configurations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Counting and Cutting Cycles of Lines and Rods in Space.

[BibT_eX]

[DOI]

Comput. Geom., 1991

1990

Necessary and sufficient conditions for hyperplane transversals.

[BibT_eX]

[DOI]

Comb., 1990

How to draw a planar graph on a grid.

[BibT_eX]

[DOI]

Hubert de Fraysseix

Comb., 1990

Weaving Patterns of Lines and Segments in Space.

[BibT_eX]

[DOI]

Emo Welzl

Proceedings of the Algorithms, 1990

Do Projections Go to Infinity?

[BibT_eX]

[DOI]

Imre Bárány

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

The Combinatorial Complexity of Hyperplane Transversals.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Radius, diameter, and minimum degree.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1989

Computing the Geodesic Center of a Simple Polygon.

[BibT_eX]

[DOI]

Micha Sharir

Günter Rote

Discret. Comput. Geom., 1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1989

Coordinate Representation of Order Types Requires Exponential Storage

[BibT_eX]

[DOI]

Bernd Sturmfels

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

Separating Two Simple Polygons by a Sequence of Translations.

[BibT_eX]

[DOI]

Ricky Pollack

Micha Sharir

Shmuel Sifrony

Discret. Comput. Geom., 1988

Computing the Link Center of a Simple Polygon.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Sue Whitesides

Chee-Keng Yap

Discret. Comput. Geom., 1988

Small Sets Supporting Fáry Embeddings of Planar Graphs

[BibT_eX]

[DOI]

Hubert de Fraysseix

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1986

Preface.

[BibT_eX]

[DOI]

Discret. Math., 1986

Upper Bounds for Configurations and Polytopes in Rd.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1986

Geometric Applications of Davenport-Schinzel Sequences

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Increasing the Minimum Distance of a Set of Points.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1985

Modeling planar configurations.

[BibT_eX]

[DOI]

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Semispaces of Configurations, Cell Complexes of Arrangements.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1984

On the Number of k-Subsets of a Set of n Points in the Plane.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1984

1983

Multidimensional Sorting.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

1982

Helly-Type Theorems for Pseudoline Arrangements in P2.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1982

1981

Three Points Do Not Determine a (Pseudo-) Plane.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1981

1980

Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1980

On the Combinatorial Classification of Nondegenerate Configurations in the Plane.

[BibT_eX]

[DOI]