Fast plane extraction in 3D range data based on line segments

2011 ◽  
Author(s):  
K. Georgiev ◽  
R. T. Creed ◽  
R. Lakaemper
Keyword(s):  
Range Data ◽  
Line Segments ◽  
On Line ◽  
Plane Extraction ◽  
3D Range Data

Finding Approximate Shape Regularities for Reverse Engineering

2001 ◽  
Vol 1 (4) ◽  
pp. 282-290 ◽  
Author(s):  
F. C. Langbein ◽  
B. I. Mills ◽  
A. D. Marshall ◽  
R. R. Martin
Keyword(s):  
Reverse Engineering ◽  
Small Groups ◽  
Input Data ◽  
Boundary Representation ◽  
Range Data ◽  
Engineering Systems ◽  
Post Processing ◽  
Processing Step ◽  
3D Range Data

Current reverse engineering systems can generate boundary representation (B-rep) models from 3D range data. Such models suffer from inaccuracies caused by noise in the input data and algorithms. The quality of reverse engineered geometric models can be improved by finding candidate shape regularities in such a model, and constraining the model to meet a suitable subset of them, in a post-processing step called beautification. This paper discusses algorithms to detect such approximate regularities in terms of similarities between feature objects describing properties of faces, edges and vertices, and small groups of these elements in a B-rep model with only planar, spherical, cylindrical, conical and toroidal faces. For each group of similar feature objects they also seek special feature objects which may represent the group, e.g. an integer value which approximates the radius of similar cylinders. Experiments show that the regularities found by the algorithms include the desired regularities as well as spurious regularities, which can be limited by an appropriate choice of tolerances.

A Duplicate Chinese Document Image Retrieval System Based on Line Segment Feature in Character Image Block

2011 ◽  
pp. 14-23
Author(s):  
Yung-Kuan Chan ◽  
Tung-Shou Chen ◽  
Yu-An Ho
Keyword(s):  
Image Retrieval ◽  
Line Segment ◽  
Document Image ◽  
Experimental Results ◽  
Document Images ◽  
Rapid Progress ◽  
Image Block ◽  
Line Segments ◽  
Image Retrieval System ◽  
On Line

With the rapid progress of digital image technology, the management of duplicate document images is also emphasized widely. As a result, this paper suggests a duplicate Chinese document image retrieval (DCDIR) system, which uses the ratio of the number of black pixels to that of white pixels on the scanned line segments in a character image block as the feature of the character image block. Experimental results indicate that the system can indeed effectively and quickly retrieve the desired duplicate Chinese document image from a database.

scholarly journals Quantitative Imaging With Incident Field Modeling From Multistatic Measurements on Line Segments

2015 ◽  
Vol 14 ◽  
pp. 253-256 ◽  
Author(s):  
Soufiane Nounouh ◽  
Christelle Eyraud ◽  
Amelie Litman ◽  
Herve Tortel
Keyword(s):  
Quantitative Imaging ◽  
Incident Field ◽  
Line Segments ◽  
Field Modeling ◽  
On Line

scholarly journals Proximity problems on line segments spanned by points

2006 ◽  
Vol 33 (3) ◽  
pp. 115-129 ◽  
Author(s):  
Ovidiu Daescu ◽  
Jun Luo ◽  
David M. Mount
Keyword(s):  
Line Segments ◽  
On Line

scholarly journals Yang–Mills Measure on the Two-Dimensional Torus as a Random Distribution

2019 ◽  
Vol 372 (3) ◽  
pp. 1027-1058
Author(s):  
Ilya Chevyrev
Keyword(s):  
Random Distribution ◽  
Random Variable ◽  
Continuous Functions ◽  
Small Scale ◽  
Dimensional Torus ◽  
Hölder Continuous ◽  
Line Segments ◽  
Yang Mills ◽  
Hölder Continuous Functions ◽  
On Line

Abstract We introduce a space of distributional 1-forms $$\Omega ^1_\alpha $$Ωα1 on the torus $$\mathbf {T}^2$$T2 for which holonomies along axis paths are well-defined and induce Hölder continuous functions on line segments. We show that there exists an $$\Omega ^1_\alpha $$Ωα1-valued random variable A for which Wilson loop observables of axis paths coincide in law with the corresponding observables under the Yang–Mills measure in the sense of Lévy (Mem Am Math Soc 166(790), 2003). It holds furthermore that $$\Omega ^1_\alpha $$Ωα1 embeds into the Hölder–Besov space $$\mathcal {C}^{\alpha -1}$$Cα-1 for all $$\alpha \in (0,1)$$α∈(0,1), so that A has the correct small scale regularity expected from perturbation theory. Our method is based on a Landau-type gauge applied to lattice approximations.

VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME

2000 ◽  
Vol 10 (05) ◽  
pp. 535-552 ◽  
Author(s):  
MARK KEIL ◽  
DAVID M. MOUNT ◽  
S. K. WISMATH
Keyword(s):  
Practical Method ◽  
Visibility Graph ◽  
New Technique ◽  
Line Segments ◽  
Depth First Search ◽  
On Line ◽  
A New Technique ◽  
Visibility Polygons

Given a set S of n non-intersecting line segments in the plane, we vpresent a new technique for efficiently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygons of the endpoints of S, in output sensitive time. Depth-first spiralling is a technique that relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depth-first search. It is a practical method and has been implemented in C++ using LEDA.

Sign in / Sign up

Export Citation Format

Share Document