: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
The modelling or reconstruction of buildings has two aspects – on the one hand we need a data structure and the associated geometric information, and on the other hand we need a...
Christopher M. Gold, Rebecca O. C. Tse, Hugo Ledou...
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...
In recent years the progress of 3D scanning technologies and the consequent growing commercialization of scanners opened a large spectrum of opportunities for many professionals. ...
A. Spinelli, Fabio Ganovelli, Claudio Montani, Rob...