• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.363-369
• /
• 2001

This paper proposes a convex hull algorithm for 2D patterns. The proposed algorithm is divided ito 2steps; candidate convex point extraction and final convex point extraction. First step removes as many points as possible that cannot be convex points using simple operation. Second step computes final convex hull of 2D patterns. This method accelerates execution time, since it consists of simple operations. Experimental results show that the proposed method is faster than other 2 methods in speed.

• Journal of Institute of Convergence Technology
• /
• v.10 no.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.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.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.

• Journal of Korea Game Society
• /
• v.10 no.1
• /
• pp.157-165
• /
• 2010

This paper presents a novel real-time rendering algorithm based on spherical coordinate system of the object using convex hull. While OpenGL rendering pipeline touches all vertices of an object, the proposed method takes account the only visible vertices by examining the visible triangles of the object. In order to determine the visible areas of the object in its spherical coordinate representation, the proposed method uses 3D geometric relation of 6 plane equations of the camera frustum and the bounding sphere of the object. In addition, we compute the convex hull of the object and its maximum side factors for hidden surface removal. Simulation results showed that the quality of result image is almost same compared to original image and rendering performance is greatly improved.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.12
• /
• pp.874-880
• /
• 2019

This paper introduces a method which can be effectively used for the path planning of UAV in a realistic map which has mountainous terrains, air defense networks and radars based on the Visibility Graph. Existing studies of Visibility Graph have been studied mainly for simple shape obstacles in 2-dimensional environment such as self-driving cars which avoid buildings. However, for UAV, Visibility Graph must be used in 3-dimensional environment for the variance of altitude. This occurs significant elapsed time increase because of the increase of the amount of the visibility of node sets. To solve this problem, this paper decrease the number of nodes which consists the complex terrain environments using convex hull based on Layered Visibility Graph. With convex hull method, this paper confirmed that the elapsed time is decreased about 99.5% compared to the case which has no decrease of the number of nodes.

• Fashion & Textile Research Journal
• /
• v.12 no.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.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• 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.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.4
• /
• pp.32-40
• /
• 1994

This paper describes a smooth surface interpolating method of ship hull using a three-dimensional currie net that comes from the mesh curve fairing process. Geometric continuity(($GC^1$) is preserved across the boundary curve between patches. The three-dimensional curve net can have nonrectangular topologies, such as triangular and pentagonal topology. Among the boundary curve interpolation methods, Hermite blended Coons patch, Convex combination, and Gregory patch interpolation method are used to generate the ship hull surface. To check the fairness of the surface, the numerical method of surface/surface intersection problem is adopted. An application to an actual ship hull is given as an example.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• 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.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.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".