Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Vertex based data dependent triangulations

From MaRDI portal
Publication:1183517
Jump to:navigation, search

DOI10.1016/0167-8396(91)90008-YzbMath0743.65108MaRDI QIDQ1183517

J. L. Brown

Publication date: 28 June 1992

Published in: Computer Aided Geometric Design (Search for Journal in Brave)


zbMATH Keywords

triangulationcomputer aided designconvex hullcomputational geometryDelaunay surfacespiecewise linear interpolating surfaceabsolute errorsangles between normalsnumbers of iterationspiecewise linear analog of curvaturevertex local optimization


Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Descriptive geometry (51N05)


Related Items

A research note on design of fair surfaces over irregular domains using data-dependent triangulation, Rapid prototyping through scanned point data, The maximum opposite angulation for mesh construction, Directional adaptive surface triangulation, Fast Delaunay triangulation in three dimensions



Cites Work

  • Unnamed Item
  • Minimal roughness property of the Delaunay triangulation
  • Cubic spline fitting using data dependent triangulations
  • Data Dependent Triangulations for Piecewise Linear Interpolation
  • Scattered Data Interpolation: Tests of Some Method
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1183517&oldid=12050062"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki