Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
November 17, 2007 17:35 WSPC/Guidelines ijcga06-revised International Journal of Computational Geometry & Applications
 

Summary: November 17, 2007 17:35 WSPC/Guidelines ijcga06-revised
International Journal of Computational Geometry & Applications
c World Scientific Publishing Company
POINTERLESS IMPLEMENTATION OF
HIERARCHICAL SIMPLICIAL MESHES AND
EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
F. BETUL ATALAY
Mathematics and Computer Science Department
Saint Joseph's University, Philadelphia, PA 19131, USA
fatalay@sju.edu
DAVID M. MOUNT
Department of Computer Science and Institute for Advanced Computer Studies
University of Maryland, College Park, MD 20742, USA
mount@cs.umd.edu
Received 10 February 2005
Revised 24 May 2006
Communicated by JSB Mitchell
ABSTRACT
We describe a pointerless representation of hierarchical regular simplicial meshes, based
on a bisection approach proposed by Maubach. We introduce a new labeling scheme,

  

Source: Atalay, F. Betül - Mathematics and Computer Science Department, Saint Joseph's University

 

Collections: Mathematics