Titlebook: Computing and Combinatorics; First Annual Interna Ding-Zhu Du,Ming Li Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 Co

lipids

Constrained independence system and triangulations of planar point sets,ight triangles) that give a lower bound for the minimum weight triangulation. We also prove directly a third matching theorem for triangulations. We show that the set of light edges is a superset of some subsets of edges of a minimum weight triangulation that were studied before.

不幸的人

Conference proceedings 1995 August 1995..The 52 thoroughly refereed full papers and the 22 short presentations included in this volume were selected from a total of 120 submissions. All current aspects of theoretical computer science and combinatorial mathematics related to computing are addressed; in particular, there are se

Stress

基因组

Three dimensional weak visibility: Complexity and applications,ectilinear objects and polyhedral terrains. We show that in these special situations the weakly visible regions can be computed much faster in .(..) time and .(..) space. With these results, we obtain the first known polynomial time algorithm to decide whether or not a simple polyhedron is weakly (internally or externally) visible.

广大

Computing infinite relations using finite expressions: A new approach to the safety issue in relatilculus. An algorithm which can symbolically handle infinite relations is designed to efficiently compute all these relations. Therefore the constraint of finiteness on relational calculus can be removed.

FAZE