Titlebook: LATIN‘98: Theoretical Informatics; Third Latin American Cláudio L. Lucchesi,Arnaldo V. Moura Conference proceedings 1998 Springer-Verlag Be

MOTTO

Shape reconstruction with Delaunay complex,The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algorithmic solutions proposed in the computer science literature that are based on the Delaunay complex of the points.

Asperity

他一致

Colouring graphs whose chromatic number is almost their maximum degree,We present efficient algorithms for determining if the chromatic number of an input graph is close to .. Our results are obtained via the probabilistic method.

清楚

978-3-540-64275-6Springer-Verlag Berlin Heidelberg 1998

教唆

注意到

https://doi.org/10.1007/BFb0054304Analysis; Automat; Splines; algorithms; automata; combinatorics; combinatorics on words; communication; comp

BAN

Addictive