• Journal of the Korea Computer Graphics Society
• /
• v.23 no.1
• /
• pp.39-48
• /
• 2017

We present penetration depth (PD) computation algorithms using explicit Minkowski sum construction ($PD_e$) and implicit Minkowski sum construction ($PD_i$). Minkowski sum construction is the most time consuming part in fast PD computation. In order to address this issue, we find a candidate solution using a centroid difference and motion coherence. Then, $PD_e$ constructs or updates partial Minkowski sum around the candidate solution. In contrast, $PD_i$ constructs only a tangent plane to the Minkowski sums iteratively. In practice, our algorithms can compute PD for complicated models consisting of thousands of triangles in a few milli-seconds. We also discuss the benefits of using different construction of Minkowski sums in the context of PD.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.269-279
• /
• 2002

Geometric shape morphing is an interesting geometric operation that interpolates two geometric shapes to generate in-betweens. It is well known that Minkowski operations can be used to test and build collision-free motion paths and to modify shapes in digital image processing. In this paper, we present a new geometric modeling technique to control the morphing on geometric shapes based on Minkowski sum. The basic idea develops from the linear interpolation on two geometric shapes where the traditional algebraic sum is replaced by Minkowski sum. We extend this scheme into a Bezier-like control structure with multiple control shapes, which enables the interactive control over the intermediate shapes during the morphing sequence as in the traditional CAGD curve/surface editing. Moreover, we apply the theory of blossoming to our control structure, whereby our control structure becomes even more flexible and general. In this paper, we present mathematical models of control structure, their properties, and computational issues with examples.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.2
• /
• pp.9-17
• /
• 2010

Minkowski sum of two polyedra is an operation to compute the sum of all pairs of points contained in the polyhedra. It has been a very useful tool to solve many geometric problems arising in the areas of robotics, NC machining, solid modeling, and so on. However, very few algorithms have been proposed to compute Minkowski sum of polyhedra, because computing Minkowski sum boundaries is susceptible to roundoff errors. We propose an algorithm to robustly compute the Minkowski sum boundaries by employing the controlled linear perturbation scheme to prevent numerically ambiguous and degenerate cases from occurring. According to our experiments, our algorithm computes the Minkowski sum boundaries with the precision of $10^{-14}$ by perturbing the vertices of the input polyhedra up to $10^{-10}$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.3
• /
• pp.37-41
• /
• 2007

The semi-convexity for planar shapes has been recently introduced in [2]. As a generalization of the convextiy, semi-convexity is closed under the Minkowski sum. But the definition of semi-convexity requires that the shape boundary should satifisfy a differentiability condition $C^{1:1}$, which means that it should be possible to take the normal vector field along the domain's extended boundary. In view of the fact that the semi-convextiy is a most natural generalization of the convexity in many respects, this is a severe restriction for the semi-convexity, since the convexity requires no such a priori differentiability condition. In this paper, we generalize the semi-convexity to the closure of the class of semi-convex $\mathcal{M}$-domains for any Minkowski class $\mathcal{M}$, and show that this generalized semi-convexity is also closed under Minkowski sum.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.4
• /
• pp.262-273
• /
• 2012

We present a novel GPU algorithm to compute outer cell boundaries of 3D arrangement subdivided by a given set of triangles. An outer cell boundary is defined as a 2-manifold surface consisting of subdivided polygons facing outward. Many geometric problems, such as Minkowski sum, sweep volume, lower/upper envelop, Bool operations, can be reduced to finding outer cell boundaries with specific properties. Computing outer cell boundaries, however, is a very time-consuming job and also is susceptible to numerical errors. To address these problems, we develop an algorithm based on GPU with a robust scheme combining interval arithmetic and multi-level precisions. The proposed algorithm is tested on Minkowski sum of several polygonal models, and shows 5-20 times speedup over an existing algorithm running on CPU.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1373-1381
• /
• 2007

In this paper, we establish an equivalence form of the Brunn-Minkowski inequality for volume differences. As an application, we obtain a general and strengthened form of the dual $Kneser-S\ddot{u}ss$ inequality.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

• Journal of the Korean Mathematical Society
• /
• v.44 no.2
• /
• pp.297-306
• /
• 2007

In this paper, we present a new kind of duality between intersection bodies and projection bodies. Furthermore, we establish some counterparts of dual Brunn-Minkowski inequalities for intersection bodies.

• Journal of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.523-535
• /
• 2015

We study surfaces in Euclidean space which are obtained as the sum of two curves or that are graphs of the product of two functions. We consider the problem of finding all these surfaces with constant Gauss curvature. We extend the results to non-degenerate surfaces in Lorentz-Minkowski space.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.10a
• /
• pp.260-265
• /
• 1992

본 논문에서는 민코스키 합의 기본개념에 기초해서 2D 공간에서 Convex 다각형뿐만 아니라 일반적인 형상의 다각형, 즉 concave 다각형과 폴리라인을 포함한 기본도형 들에 대한 민코스키 합을 구현해 보고 이 결과를 토대로 민코스키 합의 특성과 민코스키 합을 이용해서 물체를 모델링 할 때의 장점 및 문제점들을 알아보고자 한다. 또한 3D 공간으로의 확장시 고려해야할 요소들과 다른 자료에서 소개된 응용가능 분야 이외의 새로운 분야에서의 사용 가능성을 살펴본다.