V. J. Milenkovic. Rotational polygon overlap minimization and compaction. Computational Geometry: Theory and Applications, 10:305--318, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Solid Map: Methods for Generating a 2-D Texture Map for .. - Carr, Hart, Maillot (1999) (1 citation) (Correct)
....problem, and judging by the small amount of literature, approximate solutions do not appear to be very interesting theoretically. The driving application for packing of general shapes is the textile industry, which seeks to optimize the use of fabric for manufacturing clothing. For example, [13] uses a global optimization technique to find a locally optimal oriented packing of complex and possibly concave polygons. Hence, we propose the following scalene triangle packing algorithm as a u map that maintains triangle shape. The algorithm is a sub optimal first fit strip pack, similar to ....
....Figure 17 (right) These artifacts are caused by the boundingrectangle packing algorithm used to place the connected mesh components into texture space. The packing results could be improved with the implementation of a more advanced general polygon packing algorithm, such as the one described by [13]. While the scalene triangle packing method is the best choice to avoid distortion, and packs texture memory more efficiently than the projection methods, its disregard for mesh topology results in numerous seams. These seams are more obvious than the seams resulting from the simple and area ....
V. J. Milenkovic. Rotational polygon overlap minimization and compaction. Computational Geometry: Theory and Applications, 10:305--318, 1998.
Optimization-Based Animation - Milenkovic, Schmidl (2001) (7 citations) Self-citation (Milenkovic) (Correct)
.... position based physics used linear programming to update the positions of bodies [18] This work was a generalization of an algorithm for translational compaction of two dimensional part layouts [14] He has also generalized the compaction algorithm to allow rotations in two dimensions [17]. However, the position update algorithm we present here is not simply a three dimensional A B n Figure 3: Separating plane between bodies A and B with normal vector n. generalization of the rotational compaction algorithm. In contrast to his position based approach, our bodies elastically ....
....of each QP as small as possible. Each constraint in the QP refers to a vertex on a body and a separating plane with respect to another body. We cannot simply add constraints for every vertex with respect to every separating plane. Instead, we employ Milenkovic s reckless dynamic update approach [17]. For each close pair of bodies, we first find critical vertices and add constraints (Equation 11 or 12) only for these. Critical vertices are those which lie within a slab of the separating plane at the current positions. In Figure 4, only one true contact is present, but four vertices (a, b, c ....
V. J. Milenkovic. Rotational polygon overlap minimization and compaction. Computational Geometry: Theory and Applications, 10:305--318, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC