Titlebook: STACS 92; 9th Annual Symposium Alain Finkel,Matthias Jantzen Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Automat.alg

煤渣

Efficient algorithms for solving systems of linear equations and path problems,nd for .-near-planar graphs [22]. These algorithms include the following:.One corollary of these results is that the single source and all pairs shortest path problems are solvable in O(n) and O(n.) steps, respectively, for any of the decomposable graph classes in [5].

沐浴

craven

A simplified technique for hidden-line elimination in terrains,me, where . is the size of the final display. While the asymptotic performance is the same as that of the previously best known algorithm, our implementation is simpler and more practical, because we try to take full advantage of the specific geometrical properties of the terrain. Our main data stru

惰性气体

A competitive analysis of nearest neighbor based algorithms for searching unknown scenes, the scene and searching the scene for a recognizable target whose location is unknown. We use competitive analysis as a tool for comparing algorithms. In the case of convex obstacles, we show a tight θ(min(., √kα)) bound on the competitiveness for these problems, where . and . are aspect ratio and

逃避责任

思考

性满足

A plane-sweep algorithm for finding a closest pair among convex planar objects,pair with respect to any L. -metric, 1≤p≤∞, for planar configurations consisting of n (possibly intersecting) compact convex objects such as line segments, circular discs and convex polygons. For configurations of line segments or discs the algorithm runs in asymptotically optimal time O(n log n). F

装饰

Linear approximation of simple objects, to solve the . and the . problems. For the first problem, a line minimizing the maximum weighted distance to the polygons can be found in .. log .) time and O(n.) space. The time and space complexities can be reduced to O(. log .) and ., respectively, when the weights are equal. For the second prob

胰脏

Fast and optimal simulations between CRCW PRAMs,cessors. The simulation is optimal, in the sense that the product of its slowdown and the number of simulating processors is within a constant factor of the number of simulated processors. It subsumes most previous work on randomized simulations between .-processor CRCW PRAMs with infinite memories.

发生

0302-9743 nguages, structuralcomplexity,computational geometry and learning theory, complexityandcommunication, distributed systems, complexity, algorithms,cryptography, VLSI, words and rewriting, and systems.978-3-540-55210-9978-3-540-46775-5Series ISSN 0302-9743 Series E-ISSN 1611-3349