138 search results - page 9 / 28 » K-Guarding Polygons on the Plane |
COMPGEOM
1990
ACM
13 years 11 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...
ISCAS
1993
IEEE
13 years 11 months ago
1993
IEEE
Abstract—The range of operating conditions for a seriesparallelnetworkofvariablelinearresistors, voltagesources, and current sources can be represented as a convex polygon in a T...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of reconstructing a road network from a collection of path traces and provide guarantees on the accuracy of the reconstruction under reasonable assumptions...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
SIAMDM
2010
13 years 6 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...