Richard Pollack

From MaRDI portal
Person:238454

Available identifiers

zbMath Open pollack.richardDBLP39/3009WikidataQ7328468 ScholiaQ7328468MaRDI QIDQ238454

List of research outcomes





PublicationDate of PublicationType
A Helly-type theorem for hyperplane transversals to well-separated convex sets2017-09-29Paper
Allowable double-permutation sequences and double pseudoline arrangements2013-06-28Paper
Computing the first Betti number and the connected components of semi-algebraic sets2010-08-16Paper
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions2010-08-13Paper
Allowable double permutation sequences, arrangements of double pseudolines of Michel Pocchiola and their applications to planar families of convex sets2010-01-13Paper
The combinatorial encoding of disjoint convex sets in the plane2008-10-21Paper
Computing the first Betti number of a semi-algebraic set2008-08-20Paper
Convexity in topological affine planes2007-12-19Paper
Interval sequences and the combinatorial encoding of planar families of convex sets2007-01-26Paper
Algorithms in real algebraic geometry2006-09-13Paper
Betti number bounds, applications and algorithms2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q52902522006-04-28Paper
Graph Drawing2005-12-07Paper
https://portal.mardi4nfdi.de/entity/Q54609182005-07-20Paper
Computing the Euler-Poincaré characteristics of sign conditions2005-06-16Paper
On the Betti numbers of sign conditions2005-01-05Paper
Algorithms in real algebraic geometry2003-07-16Paper
A Helly-type theorem for higher-dimensional transversals2003-01-08Paper
A Helly-type theorem for hyperplane transversals to well-separated convex sets2002-11-04Paper
On the Helly number for hyperplane transversals to unit balls2001-05-17Paper
https://portal.mardi4nfdi.de/entity/Q42324682001-05-13Paper
Computing roadmaps of semi-algebraic sets on a variety1999-11-01Paper
https://portal.mardi4nfdi.de/entity/Q42284671999-03-01Paper
https://portal.mardi4nfdi.de/entity/Q43912291998-10-01Paper
On the combinatorial and algebraic complexity of quantifier elimination1998-01-22Paper
Quasi-planar graphs have a linear number of edges1998-01-05Paper
https://portal.mardi4nfdi.de/entity/Q43523271997-08-28Paper
On computing a set of points meeting every cell defined by a family of polynomials on a variety1997-07-28Paper
Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)1997-06-12Paper
On the number of cells defined by a family of polynomials on a variety1997-01-06Paper
Bounding the number of geometric permutations induced by \(k\)-transversals1996-11-03Paper
There are uncountably many universal topological planes1996-08-22Paper
Every arrangement extends to a spread1996-02-11Paper
Foundations of a theory of convexity on affine Grassmann manifolds1996-02-04Paper
Arrangements and Topological Planes1995-12-11Paper
Common tangents and common transversals1995-11-12Paper
https://portal.mardi4nfdi.de/entity/Q48486121995-10-25Paper
On the connected components of the space of line transversals to a family of convex sets1995-07-02Paper
https://portal.mardi4nfdi.de/entity/Q43172711994-12-18Paper
https://portal.mardi4nfdi.de/entity/Q31387491994-07-28Paper
https://portal.mardi4nfdi.de/entity/Q46951031994-05-19Paper
https://portal.mardi4nfdi.de/entity/Q31387461993-11-11Paper
Weaving patterns of lines and line segments in space1993-06-29Paper
Counting and cutting cycles of lines and rods in space1992-09-27Paper
Arrangements of curves in the plane --- topology, combinatorics, and algorithms1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39749571992-06-26Paper
The complexity of point configurations1992-06-25Paper
How to draw a planar graph on a grid1990-01-01Paper
The Intrinsic Spread of a Configuration in R d1990-01-01Paper
Necessary and sufficient conditions for hyperplane transversals1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746741990-01-01Paper
Radius, diameter, and minimum degree1989-01-01Paper
Computing the geodesic center of a simple polygon1989-01-01Paper
On arrangements of Jordan arcs with three intersections per pair1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57488831989-01-01Paper
Hadwiger's Transversal Theorem In Higher Dimensions1988-01-01Paper
Separating two simple polygons by a sequence of translations1988-01-01Paper
Computing the link center of a simple polygon1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952191988-01-01Paper
Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)1986-01-01Paper
There are asymptotically far fewer polytopes than we thought1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37003821985-01-01Paper
Increasing the minimum distance of a set of points1985-01-01Paper
Polynomial realization of pseudoline arrangements1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36910721985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36814811985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36847371985-01-01Paper
Semispaces of configurations, cell complexes of arrangements1984-01-01Paper
On the number of k-subsets of a set of n points in the plane1984-01-01Paper
Multidimensional Sorting1983-01-01Paper
A theorem of ordered duality1982-01-01Paper
Helly-type theorems for pseudoline arrangments in \(P^ 2\).1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39419781982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39584731981-01-01Paper
Three points do not determine a (pseudo-) plane1981-01-01Paper
Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines1980-01-01Paper
On the combinatorial classification of nondegenerate configurations in the plane1980-01-01Paper
A New Identity and Some Applications1980-01-01Paper
On the graphs of I. Katai1974-01-01Paper
The next to last case of a factorial diophantine equation1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56147331970-01-01Paper

Research outcomes over time

This page was built for person: Richard Pollack