• 한국멀티미디어학회논문지
• /
• 제4권4호
• /
• pp.363-369
• /
• 2001

본 논문에서는 2 차원 패턴을 위한 볼록 헐(convex hull) 알고리즘을 제안한다. 알고리즘은 크게 후보 볼록점 추출과 최종 볼록점 추출의 두 단계로 나된다. 첫 번째 단계에서는 볼록 헐의 볼록점이 될 수 없는 점들을 최대한 간단한 연산을 사용하여 제거함으로써 속도의 향상을 기한다. 두 번째 단계에서는 첫 번째 단계에서 구해진 후보 볼록점을 대상으로 최종 볼록 헐을 구한다. 이 방법은 매우 간단한 연산으로 구성되어 있기 때문에 수행 속도면에서 향상을 가져왔다. 실험 결과, 본 논문의 방법이 기존에 사용되던 두 개의 볼록 헐 알고리즘보다 2배내지 3배의 빠른 수행 속도를 보였다.

• 융복합기술연구소 논문집
• /
• 제10권1호
• /
• pp.7-12
• /
• 2020

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

• 한국정밀공학회지
• /
• 제25권7호
• /
• pp.103-110
• /
• 2008

This paper presents a new approach of recognizing a 3D object using a single camera, based on the extended convex hull of its silhouette. It aims at minimizing the DB size and simplifying the processes for matching and feature extraction. For this purpose, two concepts are introduced: extended convex hull and measurable region. Extended convex hull consists of convex curved edges as well as convex polygons. Measurable region is the cluster of the viewing vectors of a camera represented as the points on the orientation sphere from which a specific set of surfaces can be measured. A measurable region is represented by the extended convex hull of the silhouette which can be obtained by viewing the object from the center of the measurable region. Each silhouette is represented by a relation graph where a node describes an edge using its type, length, reality, and components. Experimental results are included to show that the proposed algorithm works efficiently even when the objects are overlapped and partially occluded. The time complexity for searching the object model in the database is O(N) where N is the number of silhouette models.

• 한국게임학회 논문지
• /
• 제10권1호
• /
• pp.157-165
• /
• 2010

본 논문에서는 컨벡스 헐을 이용한 구 좌표계 기반 실시간 렌더링 알고리즘이 제안되었다. OpenGL 렌더링 파이프라인은 물체의 모든 정점들을 고려하지만, 제안된 방법은 물체의 가시 삼각형들을 검사하여 보이는 정점들만을 고려한다. 본 논문에서는 구좌표계 표현에서의 물체의 가시 영역을 결정하기 위하여, 카메라 절두체를 이루는 6개의 평면 방정식과 물체의 경계구와의 기하 관계를 이용한다. 또한 대상 물체의 컨벡스 헐(convex hull)의 최대 측면 성분(maximum side factor)을 고려하여 은면(hidden surface)을 제거하는 효과적인 방법이 구현되었다. 실험결과로부터 결과 영상이 원본 영상과 거의 같고, 렌더링 성능이 크게 개선됐음을 확인하였다.

• 한국항공우주학회지
• /
• 제47권12호
• /
• pp.874-880
• /
• 2019

본 논문에서는 무인기의 경로 계획을 위한 맵 분할 방법론 중 하나인 Visibility Graph를 산악지형, 방공망, 그리고 레이더 등의 장애물이 존재하는 실제적인 3차원 환경에서 효율적으로 사용하기 위한 방안에 대해 서술한다. 기존의 가시성 그래프는 빌딩 사이를 주행하는 자율주행 자동차와 같이 주로 2차원 환경에서 간단한 형상의 장애물에 대해 연구되어왔다. 무인기 분야에서 사용하기 위해서는 고도 변화를 위해 3차원 가시성 그래프가 적용되어야 하는데, 3차원 가시성 그래프의 경우 2차원 환경에 비해 가시성을 판단해야 하는 노드 쌍이 매우 많아진다. 이에 더해 복잡한 다각형으로 이루어진 산악 지형은 가시성 그래프의 계산 시간을 더욱 상승시키는 요인으로 작용한다. 이러한 문제를 해결하기 위해 본 논문에서는 맵을 일정 고도로 분할하는 계층형 가시성 그래프 방식을 기반으로 복잡한 산악 지형을 Convex Hull 개념을 활용하여 노드 수를 감소시켜 계산 시간을 줄이는 방법에 대해 서술하며, 노드 수를 감소시키지 않은 상태와의 계산 시간을 비교한 결과 계산 시간이 약 99.5% 감소하였음을 확인하였다.

• 한국의류산업학회지
• /
• 제12권4호
• /
• pp.467-476
• /
• 2010

The purpose of this study was to develop a plausible methodology based on experimental data how to set up darts and split lines on 3D parametric body dressed with tight-fit garment. The results were as following: Through the process of making convex hull, the concave parts were straightened to make a convex hull, especially in the center part of bust, under breast part and scapular part. To figure out the optimum positions of darts and split lines, the inflection points of curve ratio were searched along the horizontal polylines of waist and bust. This procedures produced reliable results with low deviation. Using Rapidform, CATIA and Unigraphics, six patches of bodice patterns were drawn and aligned. Paired t-test results showed the outline and area between 3D surface and 2D were not significantly different, meaning this method could be adaptable when flattening 3D surfaces. The amount of waist dart measured on the pattern showed that the highest portion was allocated on 2nd dart(back), followed by 1st dart(back), 1st dart(front), 2nd dart(front)/side dart, and center back dart. A series of findings suggested that curve ration inflection point could be used as a guide to set up darts and split line on 3D parametric model with low deviation.

• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.539-543
• /
• 2005

The research presented in this paper enables real-time 3D modeling to help make construction processes ultimately faster, more predictable and safer. Initial research efforts used an emerging sensor technology and proved its usefulness in the acquisition of range information for the detection and efficient representation of static and moving objects. Based on the time-of-flight principle, the sensor acquires range and intensity information of each image pixel within the entire sensor's field-of-view in real-time with frequencies of up to 30 Hz. However, real-time working range data processing algorithms need to be developed to rapidly process range information into meaningful 3D computer models. This research ultimately focuses on the application of safer heavy equipment operation. The paper compares (a) a previous research effort in convex hull modeling using sparse range point clouds from a single laser beam range finder, to (b) high-frame rate update Flash LADAR (Laser Detection and Ranging) scanning for complete scene modeling. The presented research will demonstrate if the FlashLADAR technology can play an important role in real-time modeling of infrastructure assets in the near future.

• 대한조선학회논문집
• /
• 제31권4호
• /
• pp.32-40
• /
• 1994

선박설계에 있어 초기선형설계는 설계요구를 만족하는 초기선형 정의와 정의된 선형의 순정 과정을 거친다. 이 과정에서 선형의 3차원적 정의와 효과적인 순정방법이 동시에 요구된다. 본 논문에서는 곡선망 선형순정법의 결과로 얻어지는 곡선망 선형을 이용하여 곡면간 기하학적 연속($GC^1$)이 만족되는 곡면으로 선형을 정의하였다. 본 논문에서 제시된 방법은 곡선망의 생성과정에서 나타날 수 있는 불규칙한 다각형에 대해서도 곡면화가 가능한 방법이다. Hermite 혼합 Coons 면조각, Convex 조합, Gregory 면조각 보간방법을 선형곡면화에 적용시켜 선체를 3차원 곡면으로 표현했다. 생성된 곡면의 순정도에 대한 검증은 곡면간 교차를 통한 수치적인 방법을 적용하였으며, 실선에 작용한 결과를 예로서 보였다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.637-641
• /
• 2007

Airborne LIDAR (Light Detection and Ranging) technology has reached a degree of the required accuracy in mapping professions, and advanced LIDAR systems are becoming increasingly common in the various fields of application. LiDAR data constitute an excellent source of information for reconstructing the Earth's surface due to capability of rapid and dense 3D spatial data acquisition with high accuracy. However, organizing the LIDAR data and extracting information from the data are difficult tasks because LIDAR data are composed of randomly distributed point clouds and do not provide sufficient semantic information. The main reason for this difficulty in processing LIDAR data is that the data provide only irregularly spaced point coordinates without topological and relational information among the points. This study introduces an efficient and robust method for automatic extraction of building footprints using airborne LIDAR data. The proposed method separates ground and non-ground data based on the histogram analysis and then rearranges the building boundary points using convex hull algorithm to extract building footprints. The method was implemented to LIDAR data of the heavily built-up area. Experimental results showed the feasibility and efficiency of the proposed method for automatic producing building layers of the large scale digital maps and 3D building reconstruction.

• 대한수학회보
• /
• 제33권1호
• /
• pp.1-16
• /
• 1996

Earlier in 1935[12], M. S. Robertson introduced the class of quadrant preserving functions. More precisely, let Q be the class of all functions f(z) analytic in the unit disk $D = {z : $\mid$z$\mid$ < 1}$ such that f(0) = 0, f'(0) = 1, and the range f(z) is in the j-th quadrant whenever z is in the j-th quadrant of D, j = 1,2,3,4. This class Q contains the subclass of normalized, odd univalent functions which have real coefficients. On the other hand, this class Q is contained in the class T of odd typically real functions which was introduced by W. Rogosinski [13]. Clearly, if $f \in Q$, then f(z) is real when z is real and therefore the coefficients of f are all real. Recently, it was observed by Y. Abu-Muhanna and T. H. MacGregor [1] that any function $f \in Q$ is odd. Instead of functions "preserving quadrants", the authors [1] have introduced the notion of "preserving sectors".