Titlebook: Algorithms and Computation; 24th International S Leizhen Cai,Siu-Wing Cheng,Tak-Wah Lam Conference proceedings 2013 Springer-Verlag Berlin

Confidential

Geodesic-Preserving Polygon Simplificationons of numerous problems on polygons (including shortest paths, geodesic hulls, separating point sets, and Voronoi diagrams) are equivalent for both . and ., our algorithm can be used as a preprocessing step for several algorithms and makes their running time dependent on the number of reflex vertices rather than on the size of?..

Observe

一瞥

Beating , in Approximate LZW-Compressed Pattern Matchingriodicity-based argument in a way that is computationally effective even if we operate on a compressed representation of a string, while the previous solutions were either based on a dynamic programming, or a black-box application of tools developed for uncompressed strings.

老巫婆

hegemony

細胞學(xué)

Nmda-Receptor

Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle InformatiWe propose a linear working space algorithm for reconstructing a simple polygon from the visibility angle information at vertices up to similarity. We also modify the algorithm such that its running time is sensitive to the size of visibility graph and also the diameter of a triangulation of the polygon.

Cerumen

符合規(guī)定

Algorithms and Computation978-3-642-45030-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

含糊其辭