Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
LiDAR Point Clouds to 3-D Urban Models A Review
R Wang, J Peethambaran… - IEEE Journal of Selected …, 2018 - ieeexplore.ieee.org
Three-dimensional (3-D) urban models are an integral part of numerous applications, such
as urban planning and performance simulation, map** and visualization, emergency …
as urban planning and performance simulation, map** and visualization, emergency …
Surface reconstruction from unorganized points
H Hoppe, T DeRose, T Duchamp, J McDonald… - Proceedings of the 19th …, 1992 - dl.acm.org
We describe and demonstrate an algorithm that takes as input an unorganized set of points
{xl,.... xn}⊂ R3 on or near an unknown manifold M, and produces as output a simplicial …
{xl,.... xn}⊂ R3 on or near an unknown manifold M, and produces as output a simplicial …
Three-dimensional alpha shapes
H Edelsbrunner, EP Mücke - ACM Transactions On Graphics (TOG), 1994 - dl.acm.org
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it
is sometimes useful or required to compute what one might call the “shape” of the set. For …
is sometimes useful or required to compute what one might call the “shape” of the set. For …
[PDF][PDF] Surface reconstruction by Voronoi filtering
N Amenta, M Bern - Proceedings of the fourteenth annual symposium on …, 1998 - dl.acm.org
We give a simple combinatorial algorithm that computes a piecewlze-linear approximation of
a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to …
a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to …
[КНИГА][B] Handbook of graph drawing and visualization
R Tamassia - 2013 - books.google.com
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Restricted delaunay triangulation for explicit surface reconstruction
P Wang, Z Wang, S **FiniteSets.pdf" data-clk="hl=uk&sa=T&oi=gga&ct=gga&cd=6&d=7870343798591085054&ei=yue_Z4DaItaIieoPxfL62A0" data-clk-atid="_lk4Z_wTOW0J" target="_blank">[PDF] ista.ac.at
Surface reconstruction by wrap** finite sets in space
H Edelsbrunner - Discrete and computational geometry: the Goodman …, 2003 - Springer
Given a finite point set in R 3, the surface reconstruction problem asks for a surface that
passes through many but not necessarily all points. We describe an unambiguous definition …
passes through many but not necessarily all points. We describe an unambiguous definition …
Automatic reconstruction of 3D CAD models from digital scans
F Bernardini, CL Bajaj, J Chen… - International Journal of …, 1999 - World Scientific
We present an approach for the reconstruction and approximation of 3D CAD models from
an unorganized collection of points. Applications include rapid reverse engineering of …
an unorganized collection of points. Applications include rapid reverse engineering of …
Interpolation and approximation of surfaces from three-dimensional scattered data points
R Mencl, H Muller - Scientific Visualization Conference …, 1997 - ieeexplore.ieee.org
There is a wide range of applications for which surface interpolation or approximation from
scattered data points in space is important. Dependent on the field of application and the …
scattered data points in space is important. Dependent on the field of application and the …
Shape reconstruction with Delaunay complex
H Edelsbrunner - Latin American Symposium on Theoretical Informatics, 1998 - Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant
and theoretically challenging problem. This paper presents a unified view of algorithmic …
and theoretically challenging problem. This paper presents a unified view of algorithmic …