Next Article in Journal
CADrx for GBM Brain Tumors: Predicting Treatment Response from Changes in Diffusion-Weighted MRI
Previous Article in Journal
Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks
Previous Article in Special Issue
Optimal 2-Coverage of a Polygonal Region in a Sensor Network
Article Menu

Article Versions

Export Article

Open AccessArticle
Algorithms 2009, 2(4), 1327-1349; doi:10.3390/a2041327

Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates

Department of Computer Science and Engineering, The Ohio State University, DL395, Columbus, OH, USA
*
Author to whom correspondence should be addressed.
Received: 25 September 2009 / Revised: 17 October 2009 / Accepted: 19 October 2009 / Published: 11 November 2009
(This article belongs to the Special Issue Computational Geometry)
View Full-Text   |   Download PDF [3512 KB, uploaded 12 November 2009]   |  

Abstract

Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly. View Full-Text
Keywords: Delaunay refinement; mesh generation; piecewise-smooth complexes; non-smoothness; non-manifoldness Delaunay refinement; mesh generation; piecewise-smooth complexes; non-smoothness; non-manifoldness
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Dey, T.K.; Levine, J.A. Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates. Algorithms 2009, 2, 1327-1349.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top