1672 search results - page 112 / 335 » Tightness problems in the plane |
CCCG
2007
13 years 10 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
VMV
2001
13 years 10 months ago
2001
This paper presents a new method for extracting cylinders from an unorganized set of 3D points. The originality of this approach is to separate the extraction problem into two dis...
DM
2010
13 years 9 months ago
2010
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, a...
JOC
2011
13 years 3 months ago
2011
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...