947 search results - page 116 / 190 » Discrete Geometry |
COMPGEOM
1992
ACM
15 years 1 months ago
1992
ACM
A family of sets has the (p, q) property if among any p members of the family some q have a nonempty intersection. It is shown that for every p q d + 1 there is a c = c(p, q, d)...
COMPGEOM
1990
ACM
15 years 1 months ago
1990
ACM
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
101
click to vote
CAAN
2007
Springer
15 years 1 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...