Richard Pollack

61 papers A* 8A 2B 1Journal 39Unranked 10

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