In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
We present an algorithm for the reconstruction of a surface from an unorganized set of points in space. The point data may be obtained from a laser range scanner or any other digi...
In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which ...
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas...