Reverse k nearest neighbor （RNNk） is a generalization of the reverse nearest neighbor problem and receives increasing attention recently in the spatial data index and query. RNNk query is to retrieve all the data po...Reverse k nearest neighbor （RNNk） is a generalization of the reverse nearest neighbor problem and receives increasing attention recently in the spatial data index and query. RNNk query is to retrieve all the data points which use a query point as one of their k nearest neighbors. To answer the RNNk of queries efficiently, the properties of the Voronoi cell and the space-dividing regions are applied. The RNNk of the given point can be found without computing its nearest neighbors every time by using the rank Voronoi cell. With the elementary RNNk query result, the candidate data points of reverse nearest neighbors can he further limited by the approximation with sweepline and the partial extension of query region Q. The approximate minimum average distance （AMAD） can be calculated by the approximate RNNk without the restriction of k. Experimental results indicate the efficiency and the effectiveness of the algorithm and the approximate method in three varied data distribution spaces. The approximate query and the calculation method with the high precision and the accurate recall are obtained by filtrating data and pruning the search space.展开更多
A hidden line removal algorithm for bi parametric surfaces is presented and illustrated by some experimental results. The enclosure test is done using area coordinates. A technique of moving box of encirclement is p...A hidden line removal algorithm for bi parametric surfaces is presented and illustrated by some experimental results. The enclosure test is done using area coordinates. A technique of moving box of encirclement is presented. It is found that the algorithm is of general purpose, requires minimal computer storage, has high accuracy and simplicity, and is very easy to be implemented on a computer.展开更多
A novel method which integrates the topological flexibility of the level-set approach and the simplicity of point-sampled surfaces is proposed. The grid structure resulted from the level-set approach not only offers a...A novel method which integrates the topological flexibility of the level-set approach and the simplicity of point-sampled surfaces is proposed. The grid structure resulted from the level-set approach not only offers a wide range of powerful surface editing techniques for the point set surface editing, but also facilitates the topological change with ease. With the aid of point-based resampling, the method updates the surface shape of the point-based geometry quickly without worrying about point connectivity at all. The point set surface can also change its topology properly whenever a collision with other parts of itself is detected. The experiment demonstrates their effectiveness on several scanned objects and scan-converted models. Four examples of surface editing operations： smoothing, tapering, deforming, and Boolean operations, are presented.展开更多
基金Supported by the National Natural Science Foundation of China (60673136)the Natural Science Foundation of Heilongjiang Province of China (F200601)~~
文摘Reverse k nearest neighbor （RNNk） is a generalization of the reverse nearest neighbor problem and receives increasing attention recently in the spatial data index and query. RNNk query is to retrieve all the data points which use a query point as one of their k nearest neighbors. To answer the RNNk of queries efficiently, the properties of the Voronoi cell and the space-dividing regions are applied. The RNNk of the given point can be found without computing its nearest neighbors every time by using the rank Voronoi cell. With the elementary RNNk query result, the candidate data points of reverse nearest neighbors can he further limited by the approximation with sweepline and the partial extension of query region Q. The approximate minimum average distance （AMAD） can be calculated by the approximate RNNk without the restriction of k. Experimental results indicate the efficiency and the effectiveness of the algorithm and the approximate method in three varied data distribution spaces. The approximate query and the calculation method with the high precision and the accurate recall are obtained by filtrating data and pruning the search space.
文摘A hidden line removal algorithm for bi parametric surfaces is presented and illustrated by some experimental results. The enclosure test is done using area coordinates. A technique of moving box of encirclement is presented. It is found that the algorithm is of general purpose, requires minimal computer storage, has high accuracy and simplicity, and is very easy to be implemented on a computer.
文摘A novel method which integrates the topological flexibility of the level-set approach and the simplicity of point-sampled surfaces is proposed. The grid structure resulted from the level-set approach not only offers a wide range of powerful surface editing techniques for the point set surface editing, but also facilitates the topological change with ease. With the aid of point-based resampling, the method updates the surface shape of the point-based geometry quickly without worrying about point connectivity at all. The point set surface can also change its topology properly whenever a collision with other parts of itself is detected. The experiment demonstrates their effectiveness on several scanned objects and scan-converted models. Four examples of surface editing operations： smoothing, tapering, deforming, and Boolean operations, are presented.
