6,394 research outputs found
A Survey of Methods for Converting Unstructured Data to CSG Models
The goal of this document is to survey existing methods for recovering CSG
representations from unstructured data such as 3D point-clouds or polygon
meshes. We review and discuss related topics such as the segmentation and
fitting of the input data. We cover techniques from solid modeling and CAD for
polyhedron to CSG and B-rep to CSG conversion. We look at approaches coming
from program synthesis, evolutionary techniques (such as genetic programming or
genetic algorithm), and deep learning methods. Finally, we conclude with a
discussion of techniques for the generation of computer programs representing
solids (not just CSG models) and higher-level representations (such as, for
example, the ones based on sketch and extrusion or feature based operations).Comment: 29 page
An evolutionary approach to the extraction of object construction trees from 3D point clouds
In order to extract a construction tree from a finite set of points sampled on the surface of an object, we present an evolutionary algorithm that evolves set-theoretic expressions made of primitives fitted to the input point-set and modeling operations. To keep relatively simple trees, we use a penalty term in the objective function optimized by the evolutionary algorithm. We show with experiments successes but also limitations of this approach
Solid reconstruction using recognition of quadric surfaces from orthographic views
International audienceThe reconstruction of 3D objects from 2D orthographic views is crucial for maintaining and further developing existing product designs. A B-rep oriented method for reconstructing curved objects from three orthographic views is presented by employing a hybrid wire-frame in place of an intermediate wire-frame. The Link-Relation Graph (LRG) is introduced as a multi-graph representation of orthographic views, and quadric surface features (QSFs) are defined by special basic patterns of LRG as well as aggregation rules. By hint-based pattern matching in the LRGs of three orthographic views in an order of priority, the corresponding QSFs are recognized, and the geometry and topology of quadric surfaces are recovered simultaneously. This method can handle objects with interacting quadric surfaces and avoids the combinatorial search for tracing all the quadric surfaces in an intermediate wire-frame by the existing methods. Several examples are provided
Entanglement renormalization and integral geometry
We revisit the applications of integral geometry in AdS and argue that
the metric of the kinematic space can be realized as the entanglement contour,
which is defined as the additive entanglement density. From the renormalization
of the entanglement contour, we can holographically understand the operations
of disentangler and isometry in multi-scale entanglement renormalization
ansatz. Furthermore, a renormalization group equation of the long-distance
entanglement contour is then derived. We then generalize this integral
geometric construction to higher dimensions and in particular demonstrate how
it works in bulk space of homogeneity and isotropy.Comment: 40 pages, 7 figures. v2: discussions on the general measure added,
typos fixed; v3: sections reorganized, various points clarified, to appear in
JHE
Network Flow Algorithms for Discrete Tomography
Tomography is a powerful technique to obtain images of the interior of an object in a nondestructive way. First, a series of projection images (e.g., X-ray images) is acquired and subsequently a reconstruction of the interior is computed from the available project data. The algorithms that are used to compute such reconstructions are known as tomographic reconstruction algorithms. Discrete tomography is concerned with the tomographic reconstruction of images that are known to contain only a few different gray levels. By using this knowledge in the reconstruction algorithm it is often possible to reduce the number of projections required to compute an accurate reconstruction, compared to algorithms that do not use prior knowledge. This thesis deals with new reconstruction algorithms for discrete tomography. In particular, the first five chapters are about reconstruction algorithms based on network flow methods. These algorithms make use of an elegant correspondence between certain types of tomography problems and network flow problems from the field of Operations Research. Chapter 6 deals with a problem that occurs in the application of discrete tomography to the reconstruction of nanocrystals from projections obtained by electron microscopy.The research for this thesis has been financially supported by the Netherlands Organisation for Scientific Research (NWO), project 613.000.112.UBL - phd migration 201
A quasi-Monte Carlo method for computing areas of point-sampled surfaces
A novel and efficient quasi-Monte Carlo method for computing the area of a point-sampled surface with associated surface normal for each point is presented. Our method operates directly on the point cloud without any surface reconstruction procedure. Using the Cauchy–Crofton formula, the area of the point-sampled surface is calculated by counting the number of intersection points between the point cloud and a set of uniformly distributed lines generated with low-discrepancy sequences. Based on a clustering technique, we also propose an effective algorithm for computing the intersection points of a line with the point-sampled surface. By testing on a number of point-based models, experiments suggest that our method is more robust and more efficient than those conventional approaches based on surface reconstruction.postprin
A Survey of Methods for Volumetric Scene Reconstruction from Photographs
Scene reconstruction, the task of generating a 3D model of a scene given multiple 2D photographs taken of the scene, is an old and difficult problem in computer vision. Since its introduction, scene reconstruction has found application in many fields, including robotics, virtual reality, and entertainment. Volumetric models are a natural choice for scene reconstruction. Three broad classes of volumetric reconstruction techniques have been developed based on geometric intersections, color consistency, and pair-wise matching. Some of these techniques have spawned a number of variations and undergone considerable refinement. This paper is a survey of techniques for volumetric scene reconstruction
Investigation of iterative image reconstruction in three-dimensional optoacoustic tomography
Iterative image reconstruction algorithms for optoacoustic tomography (OAT),
also known as photoacoustic tomography, have the ability to improve image
quality over analytic algorithms due to their ability to incorporate accurate
models of the imaging physics, instrument response, and measurement noise.
However, to date, there have been few reported attempts to employ advanced
iterative image reconstruction algorithms for improving image quality in
three-dimensional (3D) OAT. In this work, we implement and investigate two
iterative image reconstruction methods for use with a 3D OAT small animal
imager: namely, a penalized least-squares (PLS) method employing a quadratic
smoothness penalty and a PLS method employing a total variation norm penalty.
The reconstruction algorithms employ accurate models of the ultrasonic
transducer impulse responses. Experimental data sets are employed to compare
the performances of the iterative reconstruction algorithms to that of a 3D
filtered backprojection (FBP) algorithm. By use of quantitative measures of
image quality, we demonstrate that the iterative reconstruction algorithms can
mitigate image artifacts and preserve spatial resolution more effectively than
FBP algorithms. These features suggest that the use of advanced image
reconstruction algorithms can improve the effectiveness of 3D OAT while
reducing the amount of data required for biomedical applications
Reconstructing triangulated surfaces from unorganized points through local skeletal stars
Surface reconstruction from unorganized points arises in a variety of practical situations such
as range scanning an object from multiple view points, recovery of biological shapes from twodimensional
slices, and interactive surface sketching. [...]Reconstrução da superfície de pontos desorganizados surge em uma variedade de situações práticas,
tais como rastreamento de um objeto a partir de vários pontos de vista, a recuperação de
formas biológicas de fatias bi-dimensionais, e esboçar superfícies interativas. [...
- …