Titlebook: Algorithms and Data Structures; 5th International Wo Frank Dehne,Andrew Rau-Chaplin,Roberto Tamassia Conference proceedings 1997 Springer-V

相似

書(shū)目名稱Algorithms and Data Structures影響因子(影響力)




書(shū)目名稱Algorithms and Data Structures影響因子(影響力)學(xué)科排名




書(shū)目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Algorithms and Data Structures被引頻次




書(shū)目名稱Algorithms and Data Structures被引頻次學(xué)科排名




書(shū)目名稱Algorithms and Data Structures年度引用




書(shū)目名稱Algorithms and Data Structures年度引用學(xué)科排名




書(shū)目名稱Algorithms and Data Structures讀者反饋




書(shū)目名稱Algorithms and Data Structures讀者反饋學(xué)科排名

ARCH

Dynamic motion planning in low obstacle density environments,gh worst-case running times. The weak and realistic low obstacle density (L.O.D.) assumption results in linear complexity in the number of obstacles of the free space [1l]. In this paper we consider the dynamic version of the motion planning problem in which a robot moves among moving polygonal obst

上下倒置

多骨

失望未來(lái)

Finding cores of limited length, nodes in the tree. This problem has been examined under different constraints on the tree and on the set of paths, from which the core can be chosen. For all cases, we present linear or almost linear time algorithms, which improves the previous results due to Lo and Peng, J. Algorithms Vol. 20, 199

徹底檢查

Approximation algorithms for a genetic diagnostics problem,osis of a important class of chromosomal aberrations. An optimal solution to WDC would enable us to define a genetic assay that maximizes the diagnostic power for a specified cost of laboratory work. We develop approximation algorithms for WDC by making use of the well-known problem SET COVER for wh

檢查

Cartographic line simplication and polygon CSG formulae in ,(, log,,) time,e, such as a coastline, on a map. A constructive solid geometry (CSG) conversion for a polygon takes a list of vertices and produces a formula representing the polygon as an intersection and union of primitive halfspaces. By using a data structure that supports splitting convex hulls and finding ext

Synapse

misshapen

Offstage

A linear-time algorithm for the 1-mismatch problem, run of consecutive columns, that have some particular property. The . is to locate all maximal regions in a given alignment for which there exists a (not necessarily unique) “center” sequence such that inside the region alignment rows are within Hamming distance 1 from the center. We first describe