Rendering high quality digital terrains at interactive rates requires carefully crafted
algorithms and data structures able to balance the competing requirements of realism and …

In this paper I introduce a new mathematical tool for dealing with the refinement and/or the
improvement of unstructured triangulations: the Longest‐Edge Propagation Path associated …

In multicellular organisms, sexual reproduction requires the separation of the germline from
the soma. In flowering plants, the female germline precursor differentiates as a single spore …

Real-time rendering and multiresolution modeling of triangulated surfaces has attracted
growing interest over the last decade. For interactive visualization of very large scale grid …

Interactive visualization of large digital elevation models is of continuing interest in scientific
visualization, GIS, and virtual reality applications. Taking advantage of the regular structure …

We consider the problem of re ning quadrilateral and hexahedral element meshes. For the
two-dimensional case we present algorithms that solve the problem. A re nement algorithm …

In this paper we discuss, study and compare two linear algorithms for the triangulation
refinement problem: the known longest‐side (triangle bisection) refinement algorithm, as …

The terminal-edge Delaunay algorithm, initially called Lepp–Delaunay algorithm, deals with
the construction of size-optimal (adapted to the geometry) quality triangulation of complex …

Background and Aims A study is made by computation of the interplay between the pattern
formation of growth catalysts on a plant surface and the expansion of the surface to generate …

A method, mesh data structure and apparatus is disclosed for producing an
improved/refined/derefined mesh of finite elements for a three-dimensional object showing …