Results 1 
4 of
4
Parametrization and smooth approximation of surface triangulations
 Computer Aided Geometric Design
, 1997
"... Abstract. A method based on graph theory is investigated for creating global parametrizations for surface triangulations for the purpose of smooth surface fitting. The parametrizations, which are planar triangulations, are the solutions of linear systems based on convex combinations. A particular pa ..."
Abstract

Cited by 252 (15 self)
 Add to MetaCart
Abstract. A method based on graph theory is investigated for creating global parametrizations for surface triangulations for the purpose of smooth surface fitting. The parametrizations, which are planar triangulations, are the solutions of linear systems based on convex combinations. A particular parametrization, called shapepreserving, is found to lead to visually smooth surface approximations. A standard approach to fitting a smooth parametric curve c(t) through a given sequence of points xi = (xi,yi,zi) ∈ IR 3, i = 1,...,N is to first make a parametrization, a corresponding increasing sequence of parameter values ti. By finding smooth functions x,y,z: [t1,tN] → IR for which x(ti) = xi, y(ti) = yi, z(ti) = zi, an interpolatory curve
Convex Grid Drawings of 3Connected Planar Graphs
, 1994
"... We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting line segments and faces are convex polygons. We present a lineartime algorithm which, given an nvertex 3connected plane gr ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting line segments and faces are convex polygons. We present a lineartime algorithm which, given an nvertex 3connected plane graph G (with n 3), finds such a straightline convex embedding of G into a (n \Gamma 2) \Theta (n \Gamma 2) grid. 1 Introduction In this paper we consider the problem of aesthetic drawing of plane graphs, that is, planar graphs that are already embedded in the plane. What is exactly an aesthetic drawing is not precisely defined and, depending on the application, different criteria have been used. In this paper we concentrate on the two following criteria: (a) edges should be represented by straightline segments, and (b) faces should be drawn as convex polygons. F'ary [6], Stein [14] and Wagner [18] showed, independently, that each planar graph can be drawn in the plane in such a way that ...
On Topological Simulations in Developmental Biology
 Journal of Theoretical Biology
, 1988
"... Further study is made of the topological model framework for cell simulations that was introduced by Matela ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Further study is made of the topological model framework for cell simulations that was introduced by Matela
Monotone Drawings of Graphs
, 2012
"... We study a new standard for visualizing graphs: A monotone drawing is a straightline drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study a new standard for visualizing graphs: A monotone drawing is a straightline drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between monotonicity, planarity, and convexity, and we outline a number of open problems and future research directions. Submitted: