Self-Intersection Free and Topologically Faithful Slicing of Implicit Solid

2011 ◽  
Author(s):  
Pu Huang ◽  
Charlie C. L. Wang ◽  
Yong Chen
Keyword(s):  
Rapid Prototyping ◽  
Geometric Error ◽  
Shape Error ◽  
Contour Extraction ◽  
Line Segments ◽  
Binary Images ◽  
Efficient Approach ◽  
Implicit Solid ◽  
The Given ◽  
Memory Efficient

We present a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, we generate contours through a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplification algorithm which has the topology preserved and the geometric error controlled. The resultant contours are free of self-intersection, topologically faithful to the given r-regular solids and with shape error bounded; therefore, correct objects can be fabricated from them by rapid prototyping. Moreover, since we do not need to generate the tessellated B-rep of given solids, our approach is memory efficient — only the binary image and the finest contours on one particular slicing plane need to be stored in-core. Our method is general and can be applied to any implicit representations of solids.

Intersection-Free and Topologically Faithful Slicing of Implicit Solid

2013 ◽  
Vol 13 (2) ◽  
Author(s):  
Pu Huang ◽  
Charlie C. L. Wang ◽  
Yong Chen
Keyword(s):  
Rapid Prototyping ◽  
Geometric Error ◽  
Binary Image ◽  
Shape Error ◽  
Contour Extraction ◽  
Line Segments ◽  
Binary Images ◽  
Efficient Approach ◽  
Implicit Solid ◽  
The Given

We present a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, we generate contours by a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplification algorithm which has the topology preserved and the geometric error controlled. The resultant contours are free of self-intersection, topologically faithful to the given r-regular solids and with shape error bounded. Therefore, correct objects can be fabricated from them by rapid prototyping. Moreover, since we do not need to generate the tessellated B-rep of given solids, the memory cost our approach is low—only the binary image and the finest contours on one particular slicing plane need to be stored in-core. Our method is general and can be applied to any implicit representations of solids.

BFAST: High-Speed and Memory-Efficient Approach for NDN Forwarding Engine

2017 ◽  
Vol 25 (2) ◽  
pp. 1235-1248 ◽  
Author(s):  
Huichen Dai ◽  
Jianyuan Lu ◽  
Yi Wang ◽  
Tian Pan ◽  
Bin Liu
Keyword(s):  
High Speed ◽  
Efficient Approach ◽  
Forwarding Engine ◽  
Memory Efficient

APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS

1993 ◽  
Vol 03 (04) ◽  
pp. 383-415 ◽  
Author(s):  
LEONIDAS J. GUIBAS ◽  
JOHN E. HERSHBERGER ◽  
JOSEPH S.B. MITCHELL ◽  
JACK SCOTT SNOEYINK
Keyword(s):  
Greedy Algorithms ◽  
Np Hard ◽  
Basic Approach ◽  
Line Segments ◽  
Minimum Number ◽  
Polygonal Chains ◽  
The Given ◽  
Plane Polygon

We study several variations on one basic approach to the task of simplifying a plane polygon or subdivision: Fatten the given object and construct an approximation inside the fattened region. We investigate fattening by convolving the segments or vertices with disks and attempt to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms. We give some variants that have linear or O(n log n) algorithms approximating polygonal chains of n segments. We also show that approximating subdivisions and approximating with chains with. no self-intersections are NP-hard.

Forming Type Rapid Prototyping Development - Error Compensation with Shape Measurement -

2008 ◽  
Vol 2 (6) ◽  
pp. 462-467 ◽  
Author(s):  
Hidetake Tanaka ◽  
◽  
Naoki Asakawa ◽  
Masatoshi Hirao ◽  
Keyword(s):  
Rapid Prototyping ◽  
Sheet Metal Forming ◽  
Metal Forming ◽  
Error Compensation ◽  
Industrial Robot ◽  
Shape Measurement ◽  
Shape Error ◽  
Range Finder ◽  
Tool Positioning ◽  
Computer Aided

This study deals with the automation of metal hammering using an industrial robot and trial development of rapid prototyping of sheet metal forming. Computer-aided manufacturing (CAM) takes into account feedback considering tool positioning by using a range finder to improve depth and shape error at workpiece corners. Experimental results confirmed that our proposal reduces shape error through tool positioning optimization.

scholarly journals A Graph-based Geometric Approach to Contour Extraction from Noisy Binary Images

2015 ◽  
Vol 12 (4) ◽  
pp. 403-413 ◽  
Author(s):  
Amal Dev Parakkat ◽  
Jiju Peethambaran ◽  
Philumon Joseph ◽  
Ramanathan Muthuganapathy
Keyword(s):  
Geometric Approach ◽  
Contour Extraction ◽  
Binary Images

Research on Entity Model Directly Layering Software Design Based on the Secondary Development of AutoCAD

2013 ◽  
Vol 401-403 ◽  
pp. 491-494
Author(s):  
Li Rong Fan ◽  
Yi Qing Cao ◽  
Chong Ren
Keyword(s):  
Rapid Prototyping ◽  
Software Design ◽  
Smooth Curve ◽  
Geometric Distortion ◽  
Secondary Development ◽  
Practical Application ◽  
Line Segments ◽  
Development Tools ◽  
Straight Line ◽  
Model Layer

FDM process of rapid prototyping systems at present which can only reads the STL format file, based on this format can be get the 2-d layer is composed of straight line segments connected polygon contour, makes the model layer of information that are geometric distortion, leading to surface accuracy is poorer; Produced based on STL model for layered geometric distortion problem, this paper put forward to directly layering of entity model, and through the ObjectARX which is the secondary development tools of AutoCAD realizes layer directly in the software, the layer of 2-d contour for smooth curve, so as to ensure accuracy, it will be played an important role in the practical application later.

Encoding Geometric Information in Road Networks Extracted from Binary Images

2005 ◽  
Vol 32 (2) ◽  
pp. 179-190 ◽  
Author(s):  
Rui Carvalho ◽  
Michael Batty
Keyword(s):  
Road Networks ◽  
Processing Technique ◽  
Image Processing Technique ◽  
Automatic Extraction ◽  
Digital Imagery ◽  
Geometric Information ◽  
Line Segments ◽  
Binary Images ◽  
Recent Developments ◽  
The Individual

The authors discuss recent progress in extracting road networks from digital imagery. We briefly review recent developments in methods for the automatic extraction of road centre line networks and propose a related algorithm aimed at encoding the geometry of road networks with line segments. Our algorithm is inspired by ‘axial lines’, which have been defined as lines of uninterrupted movement within urban streetscapes or buildings. We show that axial lines appear as ridges in isovist fields. These are formed from the maximum diametric lengths of the individual isovists, sometimes called viewsheds, which make up these fields. We present an image-processing technique for the identification of lines from ridges, discuss current strengths and weaknesses of the method, and show how it can be implemented easily and effectively.

scholarly journals CONTOUR EXTRACTION OF PLANAR ELEMENTS OF BUILDING FACADES FROM POINT CLOUDS USING GLOBAL GRAPH-BASED CLUSTERING

2019 ◽  
Vol IV-2/W7 ◽  
pp. 211-219 ◽  
Author(s):  
Y. Xu ◽  
U. Stilla
Keyword(s):  
Graphical Model ◽  
Point Clouds ◽  
Contour Extraction ◽  
Segmentation Method ◽  
Unsupervised Segmentation ◽  
Line Segments ◽  
Segmentation Methods ◽  
Building Facades ◽  
Urban Scene ◽  
Building Elements

<p><strong>Abstract.</strong> In this work, we present a surface-based method to extract the contours of planar building elements in the urban scene. A bottom-up segmentation method that utilizes global graph-based optimization and supervoxel structure is developed, enabling an automatic and unsupervised segmentation of point clouds. Then, a planarity-based extraction is conducted to segments, and only the planar segments, as well as their neighborhoods, are selected as candidates for the plane fitting. The points of the plane can be identified by the parametric model given by the planarity calculation. Afterward, the boundary points of the extracted plane are extracted by the alpha-shape. Optionally, line segments can be fitted and optimized by the energy minimization with the local graphical model. The experimental results using different datasets reveal that our proposed segmentation methods can be effective and comparable with other method, and the contours of planar building elements can be well extracted from the complex urban scene.</p>

Sign in / Sign up

Export Citation Format

Share Document