<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<href>banner.jpg</href>
<size width="100%"/>
</banner>
</journal-meta>
<article-meta><doi>401</doi>
<title-group>
<article-title>A Delaunay Based Optimal Meshing Technique from Point Cloud Data</article-title>
</title-group>

<author>Tathagata Ray<sup>1</sup> and Chandu Parimi<sup>2</sup>  </author>

<aff><sup>1</sup>Department of Computer Science and Information Systems, Birla Institute of Technology and Science Pilani, Hyderabad Campus, Hyderabad, India. </aff>

<email><a href="mailto:rayt@hyderabad.bits-pilani.ac.in  ">rayt@hyderabad.bits-pilani.ac.in  </a></email>

<aff><sup>2</sup>Department of Civil Engineering, Birla Institute of Technology and Science Pilani, Hyderabad Campus, Hyderabad, India. </aff>

<email><a href="mailto:parimi@hyderabad.bits-pilani.ac.in ">parimi@hyderabad.bits-pilani.ac.in </a></email>

</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>This paper describes a methodology to generate size optimal unstructured triangular meshes from point cloud data (PCD) sampled from a smooth simple closed curve (Surface in 3D). Conventional methods generate these meshes after extracting a model definition from the given point cloud. In this work an algorithm is proposed which can bypass this explicit step of modeling as the model is inherent to a well sampled point cloud. The mesh generated will be optimal in the sense that the gradedness of the mesh is not dictated by the sampling of the PCD. This methodology will be a combination of Delaunay based meshing and Delaunay based surface reconstruction.  </p>
<p><i>Keywords: </i>Mesh generation, Delaunay triangulation, Pre-processing techniques. </p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>401</hpdf>
</fpdf>
</body>
</article>
