64 search results - page 2 / 13 » Resultant-Based Methods for Plane Curves Intersection Proble... |
CAD
1999
Springer
13 years 7 months ago
1999
Springer
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
We exhibit a polynomial time computable plane curve Γ that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
COMPGEOM
2003
ACM
14 years 21 days ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...