• Title/Summary/Keyword: 3-Point Method

Search Result 5,914, Processing Time 0.041 seconds

The integration and implementation of interior point methods for linear programming (내부점 선형계획법의 통합과 구현)

  • Jin, Heui-Chae;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.3
    • /
    • pp.429-439
    • /
    • 1995
  • The Interior point method in linear programming is classified into two categories the affine-scaling method and the logarithmic barrier method. In this paper, we integrate those methods and implement them in one shared module. First, we analyze the procedures of two interior point methods and then find a unified formula in finding directions to improve the current solution and conditions to terminate the procedure. Second, we build the shared modules which can be used in each interior point method. Then these modules are experimented in NETLIB problems.

  • PDF

Vanishing Point Detection Method Using Multiple Initial Vanishing Points (다중 초기 소실점을 이용한 소실점 검출 방법)

  • Lee, Chang-Hyung;Choi, Hyung-Il
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.2
    • /
    • pp.231-239
    • /
    • 2018
  • In this paper, we propose a vanishing point detection method using multiple initial vanishing points. Vanishing points are important geometric information that is used for reconstructing 3D structures. Three vanishing points are detected for indoor scenes. In the previous work, it could be inaccurate to detect only one initial vanishing point, because initial vanishing point getting most highest sum of voting could be deferent from the best initial vanishing point. Therefore the method which sets multiple initial vanishing point and detects a best vanishing point from them gives us preparation for the prior case. Also in this paper, we propose a adjusting vanishing point method by postprocessing of detected vanishing points. We could detect more accurate vanishing point by using postprocessing. Experimental results show that the accuracy of the vanishing point detection is about 1~2% higher than that of the existing method through the proposed method and the performance is improved accordingly.

A Study on Management Method of Point and Line Data Using Mobile GIS (모바일 GIS를 이용한 Point 및 Line형 데이터 갱신 방법에 관한 연구)

  • Jeon, Jae-Yong;Cho, Gi-Sung
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.3
    • /
    • pp.3-10
    • /
    • 2007
  • As information communication technology matures, GIS is being evolved from wire communication GIS to mobile GIS. This is due that mobile GIS satisfy mobility, field work, speed and time. Also, this is proper that mobile GIS accomplish investigation, confirmation, input and modification operations of spatial and attribute data at field. I think mobile GIS's use is the best way. Because, Mobile GIS's use can accomplish effectively the management of various kinds facilities in city. On this study, we consider diversified methods a person in charge can management point and line data with more easy and more effective method. The management methods of pint type data are free method, offset method two point method. The management methods of line type data are free method, point connection method, point and line connection method and the minimum distance connection method between point and line.

  • PDF

A NEW PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR OPTIMIZATION

  • Cho, Gyeong-Mi
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.13 no.1
    • /
    • pp.41-53
    • /
    • 2009
  • A primal-dual interior point method(IPM) not only is the most efficient method for a computational point of view but also has polynomial complexity. Most of polynomialtime interior point methods(IPMs) are based on the logarithmic barrier functions. Peng et al.([14, 15]) and Roos et al.([3]-[9]) proposed new variants of IPMs based on kernel functions which are called self-regular and eligible functions, respectively. In this paper we define a new kernel function and propose a new IPM based on this kernel function which has $O(n^{\frac{2}{3}}log\frac{n}{\epsilon})$ and $O(\sqrt{n}log\frac{n}{\epsilon})$ iteration bounds for large-update and small-update methods, respectively.

  • PDF

Neutral-point Potential Balancing Method for Switched-Inductor Z-Source Three-level Inverter

  • Wang, Xiaogang;Zhang, Jie
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.3
    • /
    • pp.1203-1210
    • /
    • 2017
  • Switched-inductor (SL) Z-source three-level inverter is a novel high power topology. The SL based impedance network can boost the input dc voltage to a higher value than the single LC impedance network. However, as all the neutral-point-clamped (NPC) inverters, the SL Z-source three-level inverter has to balance the neutral-point (NP) potential too. The principle of the inverter is introduced and then the effects of NP potential unbalance are analyzed. A NP balancing method is proposed. Other than the methods for conventional NPC inverter without Z-source impedance network, the upper and lower shoot-through durations are corrected by the feedforward compensation factors. With the proposed method, the NP potential is balanced and the voltage boosting ability of the Z-source network is not affected obviously. Simulations are conducted to verify the proposed method.

Complete 3D Surface Reconstruction from Unstructured Point Cloud

  • Kim, Seok-Il;Li, Rixie
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.12
    • /
    • pp.2034-2042
    • /
    • 2006
  • In this study, a complete 3D surface reconstruction method is proposed based on the concept that the vertices, of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out. Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.

An innovative geometry control method for short-line match precast segmental bridges

  • Xuzheng Liu;Huibing Xu;Jianyang Yu;Wei Quan
    • Advances in concrete construction
    • /
    • v.16 no.2
    • /
    • pp.79-89
    • /
    • 2023
  • The occurrence of unexpected horizontal offset in the instrument or target will result in accumulated horizontal deviation in segment alignment with traditional short-line match method. A geometry control method, the four-point method, is developed for precast segmental bridges to avoid the influences of unexpected horizontal offset. The concept of the four-point method is elucidated. Furthermore, the detailed instruments and instructions are introduced. Finally, the four-point method is validated through a practical engineering application. According to the survey data, after short-line match precast construction, the vertical deviations on both sides vary between -5 mm and 5 mm in almost all segments, and the horizontal deviations vary between -4 mm and 4 mm in all segments. Without on-site adjustment, the maximum vertical and horizontal closure gaps are 12.3 and 26.1 mm, respectively. The four-point method is suggested to alleviate the issues associated with relatively poor soil conditions in casting yard.

A Fast Correspondence Matching for Iterative Closest Point Algorithm (ICP 계산속도 향상을 위한 빠른 Correspondence 매칭 방법)

  • Shin, Gunhee;Choi, Jaehee;Kim, Kwangki
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.3
    • /
    • pp.373-380
    • /
    • 2022
  • This paper considers a method of fast correspondence matching for iterative closest point (ICP) algorithm. In robotics, the ICP algorithm and its variants have been widely used for pose estimation by finding the translation and rotation that best align two point clouds. In computational perspectives, the main difficulty is to find the correspondence point on the reference point cloud to each observed point. Jump-table-based correspondence matching is one of the methods for reducing computation time. This paper proposes a method that corrects errors in an existing jump-table-based correspondence matching algorithm. The criterion activating the use of jump-table is modified so that the correspondence matching can be applied to the situations, such as point-cloud registration problems with highly curved surfaces, for which the existing correspondence-matching method is non-applicable. For demonstration, both hardware and simulation experiments are performed. In a hardware experiment using Hokuyo-10LX LiDAR sensor, our new algorithm shows 100% correspondence matching accuracy and 88% decrease in computation time. Using the F1TENTH simulator, the proposed algorithm is tested for an autonomous driving scenario with 2D range-bearing point cloud data and also shows 100% correspondence matching accuracy.

3D Mesh Creation using 2D Delaunay Triangulation of 3D Point Clouds (2차원 딜로니 삼각화를 이용한 3차원 메시 생성)

  • Choi, Ji-Hoon;Yoon, Jong-Hyun;Park, Jong-Seung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.13 no.4
    • /
    • pp.21-27
    • /
    • 2007
  • The 3D Delaunay triangulation is the most widely used method for the mesh creation via the triangulation of a 3D point cloud. However, the method involves a heavy computational cost and, hence, in many interactive applications, it is not appropriate for surface triangulation. In this paper, we propose an efficient triangulation method to create a surface mesh from a 3D point cloud. We divide a set of object points into multiple subsets and apply the 2D Delaunay triangulation to each subset. A given 3D point cloud is cut into slices with respect to the OBB(Oriented Bounding Box) of the point set. The 2D Delaunay triangulation is applied to each subset producing a partial triangulation. The sum of the partial triangulations constitutes the global mesh. As a postprocessing process, we eliminate false edges introduced in the split steps of the triangulation and improve the results. The proposed method can be effectively applied to various image-based modeling applications.

  • PDF

Automatic Generation of Clustered Solid Building Models Based on Point Cloud (포인트 클라우드 데이터 기반 군집형 솔리드 건물 모델 자동 생성 기법)

  • Kim, Han-gyeol;Hwang, YunHyuk;Rhee, Sooahm
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.6_1
    • /
    • pp.1349-1365
    • /
    • 2020
  • In recent years, in the fields of smart cities and digital twins, research on model generation is increasing due to the advantage of acquiring actual 3D coordinates by using point clouds. In addition, there is an increasing demand for a solid model that can easily modify the shape and texture of the building. In this paper, we propose a method to create a clustered solid building model based on point cloud data. The proposed method consists of five steps. Accordingly, in this paper, we propose a method to create a clustered solid building model based on point cloud data. The proposed method consists of five steps. In the first step, the ground points were removed through the planarity analysis of the point cloud. In the second step, building area was extracted from the ground removed point cloud. In the third step, detailed structural area of the buildings was extracted. In the fourth step, the shape of 3D building models with 3D coordinate information added to the extracted area was created. In the last step, a 3D building solid model was created by giving texture to the building model shape. In order to verify the proposed method, we experimented using point clouds extracted from unmanned aerial vehicle images using commercial software. As a result, 3D building shapes with a position error of about 1m compared to the point cloud was created for all buildings with a certain height or higher. In addition, it was confirmed that 3D models on which texturing was performed having a resolution of less than twice the resolution of the original image was generated.