854 research outputs found
Computing largest circles separating two sets of segments
A circle separates two planar sets if it encloses one of the sets and its
open interior disk does not meet the other set. A separating circle is a
largest one if it cannot be locally increased while still separating the two
given sets. An Theta(n log n) optimal algorithm is proposed to find all largest
circles separating two given sets of line segments when line segments are
allowed to meet only at their endpoints. In the general case, when line
segments may intersect times, our algorithm can be adapted to
work in O(n alpha(n) log n) time and O(n \alpha(n)) space, where alpha(n)
represents the extremely slowly growing inverse of the Ackermann function.Comment: 14 pages, 3 figures, abstract presented at 8th Canadian Conference on
Computational Geometry, 199
Intersection of three-dimensional geometric surfaces
Calculating the line of intersection between two three-dimensional objects and using the information to generate a third object is a key element in a geometry development system. Techniques are presented for the generation of three-dimensional objects, the calculation of a line of intersection between two objects, and the construction of a resultant third object. The objects are closed surfaces consisting of adjacent bicubic parametric patches using Bezier basis functions. The intersection determination involves subdividing the patches that make up the objects until they are approximately planar and then calculating the intersection between planes. The resulting straight-line segments are connected to form the curve of intersection. The polygons in the neighborhood of the intersection are reconstructed and put back into the Bezier representation. A third object can be generated using various combinations of the original two. Several examples are presented. Special cases and problems were encountered, and the method for handling them is discussed. The special cases and problems included intersection of patch edges, gaps between adjacent patches because of unequal subdivision, holes, or islands within patches, and computer round-off error
Novel shape indices for vector landscape pattern analysis
The formation of an anisotropic landscape is influenced by natural and/or human processes, which can then be inferred on the basis of geometric indices. In this study, two minimal bounding rectangles in consideration of the principles of mechanics (i.e. minimal width bounding (MWB) box and moment bounding (MB) box) were introduced. Based on these boxes, four novel shape indices, namely MBLW (the length-to-width ratio of MB box), PAMBA (area ratio between patch and MB box), PPMBP (perimeter ratio between patch and MB box) and ODI (orientation difference index between MB and MWB boxes), were introduced to capture multiple aspects of landscape features including patch elongation, patch compactness, patch roughness and patch symmetry. Landscape pattern was, thus, quantified by considering both patch directionality and patch shape simultaneously, which is especially suitable for anisotropic landscape analysis. The effectiveness of the new indices were tested with real landscape data consisting of three kinds of saline soil patches (i.e. the elongated shaped slightly saline soil class, the circular or half-moon shaped moderately saline soil, and the large and complex severely saline soil patches). The resulting classification was found to be more accurate and robust than that based on traditional shape complexity indices
An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures
We study algorithmic aspects of bending wires and sheet metal into a
specified structure. Problems of this type are closely related to the question
of deciding whether a simple non-self-intersecting wire structure (a
carpenter's ruler) can be straightened, a problem that was open for several
years and has only recently been solved in the affirmative.
If we impose some of the constraints that are imposed by the manufacturing
process, we obtain quite different results. In particular, we study the variant
of the carpenter's ruler problem in which there is a restriction that only one
joint can be modified at a time. For a linkage that does not self-intersect or
self-touch, the recent results of Connelly et al. and Streinu imply that it can
always be straightened, modifying one joint at a time. However, we show that
for a linkage with even a single vertex degeneracy, it becomes NP-hard to
decide if it can be straightened while altering only one joint at a time. If we
add the restriction that each joint can be altered at most once, we show that
the problem is NP-complete even without vertex degeneracies.
In the special case, arising in wire forming manufacturing, that each joint
can be altered at most once, and must be done sequentially from one or both
ends of the linkage, we give an efficient algorithm to determine if a linkage
can be straightened.Comment: 28 pages, 14 figures, Latex, to appear in Computational Geometry -
Theory and Application
- …