Titlebook: New Results and New Trends in Computer Science; Graz, Austria, June Hermann Maurer Conference proceedings 1991 Springer-Verlag Berlin Heid

intoxicate

On the zone theorem for hyperplane arrangements, another hyperplane is O(..). This result is the basis of a time-optimal incremental algorithm that constructs a hyperplane arrangement and has a host of other algorithmic and combinatorial applications. Unfortunately, the original proof of the zone theorem, for . ≥ 3, turned out to contain a seriou

体贴

Object-oriented programming,software in general we will discuss this question within the context of one specific application area, namely computer graphics..In fact, most problems in computer graphics are excellent candidates for the application of object-oriented programming techniques which, among many other benefits, signif

荨麻

New algorithms and approaches for 1-dimensional layout compaction,these regions. Assume we are given a feasible layout containing . forbidden regions and . layout components, where the .-th layout component is a rectilinear polygon consisting of .. vertical edges, .=∑.... We present an algorithm that determines the positions of the layout components resulting in m

STRIA

Instantaneous

熟练

清楚说话

Object-oriented distributed artificial intelligence, information, distributed sensing and interpretation, and manufacturing. In such large systems, the processing increasingly needs to be distributed across multiple processors and computers. There is also a requirement for increased modularity, re-useability and maintainability in the software which

cravat

Nomadic

Verifying and recasting secret ballots in computer networks,ems, we discuss possibilities of recasting one‘s vote, as well as verifying that it has been properly counted. All this should happen without compromising secrecy or relying on trusted persons and groups.

intrigue

Face traverses and a volume algorithm for polyhedra,educed to such a calculation. For triangular polyhedra the expression for volume can be considerably simplified if a face traverse is known. We provide an example which shows that not every triangular polyhedron has a face traverse. In many applications however, a face traverse is readily available.