USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS (Q4360596)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS |
scientific article; zbMATH DE number 1078221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS |
scientific article; zbMATH DE number 1078221 |
Statements
23 March 1998
0 references
image processing
0 references
fractals
0 references
triangulation refinement algorithms
0 references
Delaunay triangulations
0 references
longest-side bisection algorithms
0 references
adaptive refinement/derefinement of triangulations
0 references
multiqrid finite element methods
0 references
0 references
USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS (English)
0 references
0.8323470950126648
0 references
