Search

For the problem of underwater single- eye non- contact measurement of fish size, it is usually necessary to measure the distance of underwater fish to obtain the three-dimensional information of its surface, this paper proposes a fish distance measurement scheme based on the laser triangulation method and conducts research on underwater laser ranging technology. According to the principle of optical path, multiple parameters need to be measured for ranging, which makes the process complex, error-prone, and slow in calculation. This paper first corrects the distortion of the image and restores its authenticity through Zhang Zhengyou's calibration method. The OpenCv open-source library is used to recognize the laser contour on the surface of the fish body, and a self-defined algorithm improves the accuracy of contour recognition. Centroid analysis is applied to the laser contour to obtain the centroid coordinates of laser brightness. By analyzing the displacement relationship between the coordinates of the laser image points and the spatial coordinates, a polynomial regression model with a one- variable fifth- order is fitted to predict the distance, simplifying the parameters. The experimental results indicate that the laser center of gravity recognition is not continuous, but can accurately identify on the fish body. The average error of the ranging model is 5. 6 mm. In 80% of the tested samples, the error of the predicted results is within 7. 0 mm, and the maximum error is within 2 cm of calibration, which meets the required accuracy for fish body distance measurement. The research suggests that this method can provide reference for further acquisition of surface three-dimensional information of fish body size. [ABSTRACT FROM AUTHOR]

Polyamorous relationships and other consensual non-monogamous relationships (CNM) have received more attention and interest from both scholars and popular communities in Western countries for more than 20 years. Contrarily, these have been underdiscussed in Taiwan. CNM relationships were mostly invisible in Taiwan; if mentioned, they were often solely connected to negative labels and stigmas. Only a handful of studies in Taiwan mention CNM relationships; fewer targeted polyamorous relationships and CNM relationships as the topic of their research and study. According to previous empirical studies in the U.S., polyamory and other CNM relationships are more common in gay-male communities. Although no empirical study has been conducted in Taiwan to estimate the population of CNM practitioners, comparatively more studies targeting gay-male relationships in Taiwan found some types of CNM relationships in their research. It is theorized that because gay-male individuals find themselves not fitting the heterosexual relationship norm, they have the opportunity to build their relationships from scratch. Because homosexual individuals have more opportunities to process and ponder what constitutes a relationship, it is easier for them to step out of monogamous norms and build their relationships differently. Considering the difficulty of recruiting polyamorous couples in Taiwan, the present study targeted gay-male couples as the participants of this study. Aiming to understand how gay couples build and sustain polyamorous relationships and their living experiences, the research question of this study was: What are the interaction patterns and dynamics among gaymale couples' polyamorous relationships? Polyamorous relationships often involve more than two people, and the dynamics and interactions could be complicated and intricate. To better understand the dynamics of the relationships and interactions between couples, the present study utilized the Structural Family Therapy framework as a theoretical lens. To uncover the mystery of this often-neglected and stigmatized relationship and provide luminance and clarity to Taiwanese scholar and popular community, this qualitative research was conducted through narrative approach aiming to analyze the interaction patterns and relationship dynamics of polyamorous relationships among gay couples. A polyamorous couple, consisting of three participants aged 32-35 years, were recruited. Their polyamorous relationship lasted for six years but ended during the study. The present study used semi-structured interviews to collect data; joint interviews were conducted with couple participants, and individual interviews were followed up to collect individual views from each participant. However, only two of the three participants were interviewed individually because of their breakup. From the interviews conducted, the following conclusions were drawn. (1) The present gay-male participants agreed not to seek romantic or sexual connections outside of their established relationship structure. Their polyamorous relationships became "closed" and all members engaged in "polyfidelity" relationship. (2) Unlike most heterosexual couples in previous studies, the present gay-male couple negotiated and stepped into a polyamorous relationship to deal with their cheating issues. (3) The researchers believe the reason this polyfidelity relationship started and ended,according to a systemic perspective and structural family therapy lens, was related to triangulation and loyalty issues. The ways in which triangulation and loyalty issues were maintained and ended the relationships were discussed. (4) The boundaries between these gay-male participants were either diffused or rigid and their relationships were both enmeshed and disengaged. Researchers believe that these boundary issues may raise negative emotions, such as jealousy between couples, and compromise couples' ability to deal with couple-hood challenges. Finally, resources and suggestions are presented for mental health, marriage, and family professionals. [ABSTRACT FROM AUTHOR]

In view of short time unhooking operation and the need to accurately identify the target handle and ranging when the robot is synchronized with the carriage, a method of automatic unhooking using binocular stereoscopic vision technology combined with the manipulator is proposed, and the vision part is deeply studied: identifying the target handle through image preprocessing and template matching technology, recovering the pose information between binocular cameras by feature detection and matching algorithm, and correcting the pose information of binocular cameras. In order to overcome the influence of uneven illumination in stereoscopic matching, a stereoscopic matching algorithm based on local fusion is proposed to obtain the disparity map. Finally, triangulation is used to calculate the depth information of the target handle in the train decomposition area to realize three-dimensional reconstruction. This method can measure the physical distance between the handles and the binocular vision system after identifying the position of the handles, so as to provide data basis for the automatic unhooking of the robot. [ABSTRACT FROM AUTHOR]

The rapid accumulation of data resources and the development of analysis technologies have expanded the scope of think tank research, and prompted think tanks to pay more attention to data intelligence. Meanwhile, higher requirements are put forward on the quality and innovation of the think tank. Facing the development needs of think tanks, i.e., modernization, innovation, and conscientization, this paper demonstrates the change of data-driven think tank researches from the perspective of the information chain. The paper analyzes the urgent need to reshape the discursive logic of the think tank, and discusses the construction scheme of triangulation for data-driven think tank research. Finally, several suggestions for optimizing the construction of think tanks are put forward, such as paying attention to the complementarity of correlation and causality, integrating the technical rationality and humanistic values, analyzing from the perspective of cyber-physical-human ternary space, seeking support from multidisciplinary knowledge, and constructing the engineering services of the think tank. [ABSTRACT FROM AUTHOR]

Objectives: With the development of modern millimeter level geodetic technology, velocity field is one of the indispensable basic elements in Geodetic work. Under the background that current velocity models have limitations such as small data, poor continuity and timeliness update, a method based on local seamless Delaunay triangulation with inverse distance weighting is presented to establish the velocity field model in Chinese mainland. Methods: Aiming at the limitations of the current velocity models, we obtain the high ‑precision coordinates and velocities of each CMONOC (crustal movement observational network of China) station, through processing the long‑term CMONOC GNSS (global navigation satellite system) observation data of recent seven years by the GAMIT/GLOBK software. And we construct the velocity field of Chinese mainland grid with the inverse distance weighted model of locally seamless Delaunay triangulation. Compared with that calculated by NNR‑NUVEL1A (no net rotation Nubia velocity 1A) Euler vector model and some other numerical fitting models, the velocity obtained by the new method in this research has the highest precision. Results: The fitting precision of horizontal velocity field constructed by this new model is better than 1.5 mm/a. By using more than 1 800 regional stations for external checking, it shows that the average of absolute value of velocity differences in East and North directions are 1.11 mm/a and 0.90 mm/a, respectively, and the corresponding mean square errors are 1.50 mm/a and 1.35 mm/a. In continental margin areas, the fitting precision of horizontal velocity filed by the method of local triangulation net is much higher than that from the whole triangulation net model. Furthermore, based on the method of local triangulation net, interpolation precision of horizontal velocity filed is higher, an improvement of about 0.3 mm/a on average, and the gross errors could be largely reduced. Conclusions: The new model, which is based on the method of local seamless Delaunay triangulation with inverse distance weighting, can effectively utilize both distance and orientation information of the adjacent points, depict subtler local features with high precision. And it overcomes the shortcomings of the large span of the whole triangulation network in the edge area and the discontinuity of the triangulation network at the edge of the secondary block. [ABSTRACT FROM AUTHOR]

Objectives:Face swapping technology has important application value in entertainment, virtual reality, film and so on. However, existing methods are limited by face pose consistency and can not over- come the influence of occlusion. Methods:We proposes a method of face swapping using convolutional neu-ral network and tiny facet primitive. Firstly,detect the face using the cascade convolutional neural network and segment the face to determine the replacement region using fully convolutional network.Then,the Wal- lis transform is applied to adjust the skin color of the source image to make it consistent with the skin color of the face in the target image.After that, using facial key points detection method based on an ensemble of regression trees and Delaunay triangulation to construct the face triangulation network,then replacing faces based on tiny facet primitive. Finally, applying Poisson fusion to eliminate splicing traces between different images. Results: We evaluate the performance of the proposed method compared with existing method through qualitative and quantitative experiments. Experimental results show that face segment can well solve the problem of occlusion such as cap,glasses,and hair.Moreover,when source image and target image have different face poses,replacing face area using tiny facet primitive separately performs better than using the whole face area. Conclusions:Our method can well solve the problem of face pose consistency limita- tion and occlusion,which has certain practical application value. [ABSTRACT FROM AUTHOR]

Models that are built based on point cloud construction usually have uneven surfaces and jagged edges. Aiming at the problem of poor visual effect of these models，this paper proposes a three-dimensional （3D） model optimization method based on the three-dimensional line feature constraint of oblique photography. First，based on the overlapping area，the quality evaluation and screening of the line segments are carried out. Second，the three-dimensional line segments are optimally reconstructed based on the iteration method with variable weights. Finally，the plane fitting and the correction and optimization of the model surface are obtained based on the triangulation，and the 3D lines are used to correct and optimize the triangulation at the edge of the building. The method is compared with the Poisson surface reconstruction method. The results show that the proposed method effectively eliminates planar convex hull and edge sawtooth；the edge precision is optimized to within one pixel，and the plane precision is optimized to 0.5 pixels. The overall accuracy of the model is nearly double of that the Poisson surface reconstruction method. Compared with the existing surface reconstruction algorithms of based on point cloud features，the proposed method greatly improves the visual effect of the model，maintains the features of the 3D model plane and edge，and improves the edge and surface accuracy of the model. [ABSTRACT FROM AUTHOR]

Aiming at the problems of low efficiency, high missing rate and secondary pollution in artificial operation on hairiness of chemical fiber draw texturing yarn(DTY)packages, a method is proposed to detect hairiness of DTY packages using laser triangulation and improved SSD model. Firstly, the image acquisition device for DTY packages is built to obtain hairiness information directly by laser triangulation. Secondly, an improved SSD detection model of DTY packages hairiness is constructed. Mobilenet is used as a new feature extractor in the front-end network, and multi-level feature pyramid is designed by feature fusion in the back-end network. Finally, the trained hairiness detection model is verified. The experimental results show that the mean average precision of the model is 97.7%, and the detection speed reaches 40 FPS. The method realizes the automatic detection of DTY packages hairiness, the detection accuracy is high and the speed is fast, which has important industrial application value. [ABSTRACT FROM AUTHOR]

In order to construct a navigation network satisfying the indoor location - based service and improve the convenience of building navigation network, based on the Building Information Model ( BIM) as the indoor three - dimensional data source, a method of building indoor navigation network based on dual graph is proposed. The method is based on the BIM model and Constrained Delaunay triangulation refinement algorithm, using the idea of the dual principle, the IFC file of the BIM model is parsed, and the semantic information, topological relationship and 3D geometric relationship contained in the BIM model are mapped. This method extracts lightweight network model suitable for indoor navigation and location service, and based on some building data, a case study is carried out. The results show that this method can abstract the navigation elements in BIM model, basically meet the requirements of cross floor indoor navigation service, and support the context aware indoor location service. The point edge geometric navigation network model has the characteristics of flexible setting and high efficiency of road finding. [ABSTRACT FROM AUTHOR]

Aiming at that complex topological structure and various feature details of tree point cloud, this paper proposed an algorithm for extract the curve skeleton based on point clou d contraction. Firstly, in order to directly apply the mesh shrinkage algorithm on the surface of the point cloud, it performed local cloud p rincipal component analysis and Delaunay triangulation on the point cloud . Secondly,for the problem th at the tree point cloud's complex topology and the details of the last branch, it used the curvature normal operator to shrink the point cloud . In view of the slenderness of the branches of the trees and the gentle curvature, it used the modified Q EM mesh simplification method to fold the triangular mesh into a one-dimensional curve skeleton. Finally, it connected and centered the resulting curve skeleton. The algorithm operated directly on the point cloud and did not require additional information and pre-processing operations. It had good robustness to noise and residual fault clouds. Experiments show that compared with other classical algorithms such as Ll-medial and Rosa, the tree point cloud skeleton extracted by the algorithm has a good topological structure, which fully expresses the biological structure and cha racteristics of trees in the natural environment. The skeleton extraction speed of the tree point cloud is increased by more than 3 times, and the branch reconstruction degree is increased by 25% . [ABSTRACT FROM AUTHOR]

Aiming to solve the problem of abnormal missing holes occurred in 3D reconstruction mesh models frequently, this paper proposed a novel method that hole-defect identification automatically and detail-preserving surface repair around the hole. Firstly, in order to determine whether the hole was a real defective hole, it detected the context irregularity and contour irregularity of the missing region. After that, it detected and matched the feature lines around the hole, which were to form the fundamental surface of the hole area, and then it introduced unconstrained triangulation for basal surface. Finally, it made use of the anisotropy of mesh to refine and adjust morphologically to improve the topological and geometric properties of the mesh. The experimental results show that the proposed method can identify the defective hole and restore the hole area' s detail features of triangular mesh models effectively. [ABSTRACT FROM AUTHOR]

The time synchronization algorithm for wireless ad hoc networks has some problems including large synchronization error and high energy consumption. A cooperative time synchronization optimization algorithm for wireless ad hoc networks is proposed on the basis of analyzing the network time synchronization models. In the proposed algorithm, an exponential delay model is used to estimate the clock offset and clock drift of pairwise nodes by constructing time synchronization likelihood function. Then the network is triangulated. The reference node is determined by dyeing, and the master node is selected by the reference node. The whole network node clock synchronization is realized by using the adaptive change of topology structure. The cooperative time synchronization optimization algorithm is established by clock joint estimation and adaptive topology, and its overall execution ensures the time synchronization of node communication link. The simulated results show that,compared with the traditional clustering topology, the proposed algorithm has achieved performance improvement in two aspects of average synchronization error and energy consumption under the control of triangulation topology proposed in this paper. [ABSTRACT FROM AUTHOR]

3D sonar always acquires the data point with outliers in the complex marine environment, which affects the post processing and visualization of point cloud. 3D beamforming imaging, maximum filtering and coordinate transformation are made for the sonar data to obtain the original point cloud. The local outlier factor (LOF) algorithm is used to eliminate the abnormal points, and a modified triangulation growing method is used for single-frame reconstruction. In the modified triangulation growing method, the crucial process of ‘the third point’ finding in triangular mesh generation is simplified. A denoising method based on LOF algorithm can be used to eliminate the points not belonging to the target under the premise in keeping the real contour of target compared with the traditional threshold denoising method. And the 3D reconstruction result of more realistic target contour can be achieved from the sonar data obtained by the proposed denoising method. [ABSTRACT FROM AUTHOR]

To solve the shortcoming that there will be some holes and/or redundant triangles when non-uniform point cloud is reconstructed by BPA(ball pivoting algorithm), a new self-adaptive ball pivoting algorithm is proposed. The improved algorithm is driven by an intrinsic property of point cloud, which is initially proposed. And according to the reconstructed surface area, a new method of surface reconstruction quality evaluation is also proposed. Firstly, three isolated points are selected to build a seed triangle, according to the points 􀆳 vectors, position, spacing, connection and so on. Then, the radius r of the pivoting ball is adaptively calculated based on the intrinsic property of point cloud and front edge length. Finally, a suitable third point is selected by pivoting the ball of radius r around the front edge, to expand the triangulation. Experiments on Dragon and Bunny point cloud show that the proposed algorithm can adaptively reconstruct the surface of both uniform and non-uniform point cloud.Moreover,it is robust,efficient and needs no manual intervention. The reconstructed surface is of high-quality according to the proposed method of surface reconstruction quality evaluation. [ABSTRACT FROM AUTHOR]

In the area of cartography and geographic information science, the center points of area features are related to many fields. The centroid is a conventional choice for center point of area feature. However, it is not suitable for features with a complex shape for the center point may be outside the area or not fit the visual center so well. We propose a novel method to calculate the center point of area feature based on triangulation skeleton graph. We define two kinds of centrality of vertices in skeleton graph according to the centrality theory in graph and network analysis. Through the measurement of vertices centrality, the center points of polygon area features are defined as the vertices with maximum centrality. The complexity and special cases are discussed. A cognitive experiment is designed to test the usability of our method based on 448 districts and cities area features. The experimental result shows that the method is more suitable for complex area features than conventional centroid. [ABSTRACT FROM AUTHOR]

Focusing on the shape similarity aspect in linear feature generalization ’s quality assessment problem, this paper presents a novel shape similarity assessment method for linear feature generalization. By introducing the constrained Delaunay triangulation and convex hull, the two-side root-bend series are generated. After that, the bend trees are constructed on every root-bend to form the two-side bend forest shape representation model, in which every bend on every level is represented by a triangle. Based on this model, together with the geo-location of the linear feature, the shape similarity between the linear feature before and after generalization is assessed. Experimental results show that, this method can distinguish shape features of different levels effectively, thus achieving the same result as subject shape cognition, and can identify quality problems caused by linear feature generalization. [ABSTRACT FROM AUTHOR]

An automated method for aggregating depth contour based on triangulation is proposed. Firstly, an automatic method to detect aggregating contours is proposed, which doesn't need to reco-gnize the submarine topography features. Secondly, triangles to construct the bridge areas are filtered, and the bridge areas are expanded and related "holes" are filled. Next, the bend areas to generalize are detected. Then generalized areas are derived by merging the bride areas and generalizing bend areas, and then the aggregated result contours are achieved by conducting symmetric difference calculation on the boundary of generalized areas and the aggregating contours. Test results show that the method proposed in this paper can detect the aggregating contours correctly, and the aggregated results not only can guarantee navigation safety but also can achieve a legible and smooth depth contour. [ABSTRACT FROM AUTHOR]

Aimed at the characteristics of formation data, this paper firsdy analyzed the shortcomings of the contour drawing method and proposed a new partition method, which realized the partition of data sets with faults. Then it established a triangular mesh model based on the Delaunay triangulation algorithm and geometric polygons. Using the topology of constrained Delaunay triangulation and improved inverse distance weighted interpolation algorithm, this paper solved the problem of elevation values on both sides of the faults. In the development environment of VC ++ and OpenSceneGraph, this paper realized the contour drawing of the stratum with heterogeneity fault. Through the drawing and visualization of the contour map of the actual oil and gas reservoir data, it proves the feasibility and accuracy of the method. [ABSTRACT FROM AUTHOR]

Automated depth contour simplification is one of the common studying content in chart generalization. There are some problems such as inaccurately recognized bends and incompletely simplified bends in existing simplification methods. To overcome the drawbacks, a simplification method based on constrained Delaunay triangulation (CDT) is proposed. Firstly, CDT is constructed to achieve the binary tree representation of depth contour. Secondly, detection of bends which needs to be simplified is improved based on CDT. Finally, variety of generalization tools are designed and a new simplification model is built to realize the complete simplification of bends on depth contour. Tests illustrate that the proposed method meets navigation safety requirements, and the main bend characters are retained and represented clearly. The position accuracy meet the request of chart production. Besides, self-intersect can be avoided validly. [ABSTRACT FROM AUTHOR]

Aiming at scattered data， a set of equally spaced cutting face in vertical direction of maximum bounding box was used to segment scattered point cloud， and the method of cavity three-dimensional model was proposed by taking cavity three-dimensional laser scanning system to obtain original data as the basis. The direction and pitch of parallel cutting surface was determined firstly to divide and cut scattered point cloud. Then the location of scattered point cloud which is in cutting surface was determined by the minimum distance method. Finally， scattered points were sorted through convex hull the minimum distance method， and it was modeled after becoming ordered points. Applications show scattered points modeling algorithm of complex cavity is accurate， which can be realized in complicated scattered point cloud modeling. [ABSTRACT FROM AUTHOR]

It is significant to research on the structures analysis of the plants’ top level, based on the highly accurate plants’ leave modules set from triangulation of plant leaves’ point clouds. The plant leaves point clouds gotten from 3D scanning technology are scattered, overlapping in space, and with many outliers. The results of the traditional triangulation are not satisfying. It improved by segmenting non-continual point clouds while generating triangulation. It also recovered the inner holes of point clouds based on triangulation. By this algorithm, it triangulated the plant leaves’ point clouds with many outliers. The result indicates that the proposed algorithm can exclude disturbs of outliers while triangulation and segmentation. Meanwhile, the extracted boundary of point could recovery of inner holes can meet all the requirements for leaves’ restructures in plants’ modeling. It also contributes significantly to the remodeling of non-continual substance’s surfaces. [ABSTRACT FROM AUTHOR]

Quality and efficiency in basic linear drawing, comparative analysis of the five kinds of typical polyline tessellation and drawing methods are presented in this paper. On the basis of V tessellating, we propose a V-O tessellating and rendering method to improve the adaptability of the V triangulation decomposition to reduce the number of vertices, triangles and triangle strips. This method can support anti-aliasing color polyline, texture polyline, and the gradient polyline. Experimental results show that the proposed method is adaptable and performs well. [ABSTRACT FROM AUTHOR]

To raise the quality and generation velocity of triangular meshes, this paper proposed a novel surface triangular mesh generation method for cylinder and cone. Based on the surface shape characteristics and the regular triangle unit, it finished the triangulation directly in 3D according to the advancing layers principle of AFM (advancing front method). Experimental results demonstrate that this method can avoid the boundary adjustment problem of mapping method and the accumulated deformation resulted by recursion decomposition of AFM, and need no coordinate transformation and the time-consuming legal examination, therefore can efficiently and rapidly generate a higher quality surface meshes. [ABSTRACT FROM AUTHOR]

Due to the temporal and spatial complexity in the local inference of multiply sectioned Bayesian networks (MSBN), an improved algorithm for the local inference of MSBN was proposed. The algorithm redefined the model of MSBN with an object-oriented language. Combined with the concept of vertex degree in graph theory, the algorithm was optimized based on the joint tree algorithm. Considering that the outcome of triangulation was not single, the improved algorithm offered a general solution, which helped to convey message faster and greatly shorten inference time. Finally, an instance of the algorithm was given for experimental analysis, whose results showed that the improved inference algorithm significantly reduces both temporal and spatial complexity. [ABSTRACT FROM AUTHOR]

A simulated annealing based morphing of linear features is presented in this paper. For the two representations of the same feature in two different scales, characteristic points are extracted first from the small scale related data by using the constrained Delaunay triangulation, then the global optimal matching between characteristic points and the large scale linear feature's vertexes is estimated by simulated annealing technique. The two linear features are divided into two groups of sub- segments by the matching results, each of the corresponding segment pair is interpolated using the linear interpolation method. Simulation example and actual data show that the Morphing method proposed in this paper, which taking into account the generalization operators of bend simplification, deletion, exaggeration and typification, can effectively keep the original linear feature's structure characteristics and improve the accuracy of morphing transformation. [ABSTRACT FROM AUTHOR]

Combined 1 lie- surface features of Guizhou’s ethnic crafts clay whistle with existing surface modeling,this paper discussed a method of surface reconstruction based on triangular mesh NURBS. Firstly, the Delaunay triangulation was done on the point cloud and the Bezier surface was reconstructed, which was G1 continuous. And then by transforming the triangular domain into the rectangular domain, it reconstructed the Coons surface for every rectangular domain, finally, it would obtain a smooth stitching NUKBS surfaces through interpolating Coons surfaces. This method combined the flexibility and accuracy of the triangular surface reconstruction and the generality of the rectangular surface reconstruction, and applied it in the surface reconstruction of the ethnic handicrafts of Guizhou. The proposed method effectively improves the accuracy and the quality of the surface reconstruction of the ethnic handicrafts. [ABSTRACT FROM AUTHOR]

The paper discussed characteristics of Forman theory and presented an optimization model based on discrete Morse theory, which could obtain an optimal value or approximate optimal one by the algorithm of constructing a discrete Morse function in 3-dimensional space. It is a radical attempt. The experimental results show that this model is effective for applications and especially for optimization problem of a large amount of data. [ABSTRACT FROM AUTHOR]

To improve the independence and matching efficiency of NRX (New Relaxation based Particle Tracking Algorithm), instead of settled thresholds, DT (Delaunay Triangulation) unstructured grid was introduced to determine the matching candidate particles set and reference particle set in which the selected particles are close to and quasi parallel with the target particle. The validity of introduced DT was thoroughly tested by simulated motion of monopolar vortices in a strain flow. It indicates that DT can determine the reference particle set effectively, while DT fails to determine the candidate particle set because the nearby-selected property of DT is inconsistent with the physical property of particles termed as being neighboring of candidate particles. Finally, on the basis of NRX, a new algorithm DT-NRX was proposed by using DT to determine the reference particle set. Compared to the conventional NRX, DT-NRX behaves more independently by abandoning one parameter and more effectively in high-density cases. [ABSTRACT FROM AUTHOR]

Due to existing holes in the scanning 3D models, this paper presented a novel hole-filling algorithm based on the curvature character. The main idea of this approach was to fill the holes fast by advancing front method in order to obtain the initial patch mesh and the adjustment would be carried out by the curvature feature of edge point of holes. Firstly it extracted the boundary of hole based on the nature of adjacent triangles, then covered the hole by the initial patch mesh which obtained by using the advancing front method. Second it performed the subdivision for the patch mesh according to the standard of curvature. Finally it re-positioned the vertices of newly triangles by delaunay principle to make the patch better fitting the surrounding mesh. The experiment shows that this algorithm is simple, efficient and stable, which can repair different kind of holes. [ABSTRACT FROM AUTHOR]