A slicing algorithm of point cloud for rapid prototyping

H. T. Park, Minho Chang, S. C. Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Presented in the paper is an algorithm for generating a section curve by slicing a point cloud which may include tens of thousands of points. Although there have been couple of previous results, they are very sensitive on the density variations and local noises. In the paper, three technological requirements are identified; 1) dominant point sampling, 2) local vibration avoidance and 3) robustness on the density variations. To satisfy these requirements, we propose a new slicing algorithm based on a Virtual Edge (VE) approach, which is known to have a weakness for density variations. To complement the weakness of VE approach, Density Gauge (DG) sphere and point supplementing techniques have been developed and applied. The DG sphere and point supplementing techniques help to identify accurate virtual edges, which should be sliced to generate contour points. To compute the section curves from the contour points, the proposed algorithm employs the 2D Delaunay triangulation technique. The algorithm has been implemented and tested with various examples.

Original languageEnglish
Title of host publicationSummer Computer Simulation Conference 2007, SCSC'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07
Pages1321-1326
Number of pages6
Volume2
Publication statusPublished - 2007 Dec 1
Externally publishedYes
EventSummer Computer Simulation Conference 2007, SCSC 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007 - San Diego, CA, United States
Duration: 2007 Jul 152007 Jul 18

Other

OtherSummer Computer Simulation Conference 2007, SCSC 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007
CountryUnited States
CitySan Diego, CA
Period07/7/1507/7/18

Fingerprint

Rapid Prototyping
Slicing
Point Cloud
Rapid prototyping
Gages
Gauge
Triangulation
Curve
Delaunay triangulation
Requirements
Sampling
Complement
Vibration
Robustness

Keywords

  • Point cloud
  • Rapid prototyping
  • Reverse engineering
  • Slicing

ASJC Scopus subject areas

  • Modelling and Simulation

Cite this

Park, H. T., Chang, M., & Park, S. C. (2007). A slicing algorithm of point cloud for rapid prototyping. In Summer Computer Simulation Conference 2007, SCSC'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07 (Vol. 2, pp. 1321-1326)

A slicing algorithm of point cloud for rapid prototyping. / Park, H. T.; Chang, Minho; Park, S. C.

Summer Computer Simulation Conference 2007, SCSC'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07. Vol. 2 2007. p. 1321-1326.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, HT, Chang, M & Park, SC 2007, A slicing algorithm of point cloud for rapid prototyping. in Summer Computer Simulation Conference 2007, SCSC'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07. vol. 2, pp. 1321-1326, Summer Computer Simulation Conference 2007, SCSC 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007, San Diego, CA, United States, 07/7/15.
Park HT, Chang M, Park SC. A slicing algorithm of point cloud for rapid prototyping. In Summer Computer Simulation Conference 2007, SCSC'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07. Vol. 2. 2007. p. 1321-1326
Park, H. T. ; Chang, Minho ; Park, S. C. / A slicing algorithm of point cloud for rapid prototyping. Summer Computer Simulation Conference 2007, SCSC'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07. Vol. 2 2007. pp. 1321-1326
@inproceedings{992cc9cdc1b2445ea874c23c5fbe1ae8,
title = "A slicing algorithm of point cloud for rapid prototyping",
abstract = "Presented in the paper is an algorithm for generating a section curve by slicing a point cloud which may include tens of thousands of points. Although there have been couple of previous results, they are very sensitive on the density variations and local noises. In the paper, three technological requirements are identified; 1) dominant point sampling, 2) local vibration avoidance and 3) robustness on the density variations. To satisfy these requirements, we propose a new slicing algorithm based on a Virtual Edge (VE) approach, which is known to have a weakness for density variations. To complement the weakness of VE approach, Density Gauge (DG) sphere and point supplementing techniques have been developed and applied. The DG sphere and point supplementing techniques help to identify accurate virtual edges, which should be sliced to generate contour points. To compute the section curves from the contour points, the proposed algorithm employs the 2D Delaunay triangulation technique. The algorithm has been implemented and tested with various examples.",
keywords = "Point cloud, Rapid prototyping, Reverse engineering, Slicing",
author = "Park, {H. T.} and Minho Chang and Park, {S. C.}",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9781622763580",
volume = "2",
pages = "1321--1326",
booktitle = "Summer Computer Simulation Conference 2007, SCSC'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07",

}

TY - GEN

T1 - A slicing algorithm of point cloud for rapid prototyping

AU - Park, H. T.

AU - Chang, Minho

AU - Park, S. C.

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Presented in the paper is an algorithm for generating a section curve by slicing a point cloud which may include tens of thousands of points. Although there have been couple of previous results, they are very sensitive on the density variations and local noises. In the paper, three technological requirements are identified; 1) dominant point sampling, 2) local vibration avoidance and 3) robustness on the density variations. To satisfy these requirements, we propose a new slicing algorithm based on a Virtual Edge (VE) approach, which is known to have a weakness for density variations. To complement the weakness of VE approach, Density Gauge (DG) sphere and point supplementing techniques have been developed and applied. The DG sphere and point supplementing techniques help to identify accurate virtual edges, which should be sliced to generate contour points. To compute the section curves from the contour points, the proposed algorithm employs the 2D Delaunay triangulation technique. The algorithm has been implemented and tested with various examples.

AB - Presented in the paper is an algorithm for generating a section curve by slicing a point cloud which may include tens of thousands of points. Although there have been couple of previous results, they are very sensitive on the density variations and local noises. In the paper, three technological requirements are identified; 1) dominant point sampling, 2) local vibration avoidance and 3) robustness on the density variations. To satisfy these requirements, we propose a new slicing algorithm based on a Virtual Edge (VE) approach, which is known to have a weakness for density variations. To complement the weakness of VE approach, Density Gauge (DG) sphere and point supplementing techniques have been developed and applied. The DG sphere and point supplementing techniques help to identify accurate virtual edges, which should be sliced to generate contour points. To compute the section curves from the contour points, the proposed algorithm employs the 2D Delaunay triangulation technique. The algorithm has been implemented and tested with various examples.

KW - Point cloud

KW - Rapid prototyping

KW - Reverse engineering

KW - Slicing

UR - http://www.scopus.com/inward/record.url?scp=84870163004&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870163004&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781622763580

VL - 2

SP - 1321

EP - 1326

BT - Summer Computer Simulation Conference 2007, SCSC'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07

ER -