About J-GLOBAL

日本語

Font size
  • A
  • A

Articleの詳細情報

ArticleJ-GLOBAL ID:200902001994573690整理番号:91A0164200

An optimal algorithm for computing a minimum nested nonconvex polygon.

ネストされた最小非凸多角形の計算のための最適アルゴリズム

著者:GHOSH S K(Tata Inst. Fundamental Research, Bombay, IND)、MAHESHWARI A(Tata Inst. Fundamental Research, Bombay, IND)
資料名:Inf Process Lett 巻:36 号:6 ページ:277-280
発行年:1990年12月15日
  • J-GLOBAL home
  • Bookmark J-GLOBAL

J-GLOBAL: Linking, Expanding and Sparking

About J-GLOBAL

Linking

J-GLOBAL links information that represents the key to research and development. For example, linking articles and patents with people (authors and inventors) enables the extraction of a sequence of information.
It’s useful for making new discoveries and uncovering new information.

Expanding

The system enables searches of similar kinds of content through linkage with external sites.
It helps you to obtain knowledge from dissimilar fields and discover concepts that cross the boundaries of specialisms.

Sparking

Through repeated linkage and expansioniteration, J-GLOBAL provides unexpected hints for problem-solving and the illumination of new ideas.