Greedy triangulation improvement over lookahead search

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F99%3A00043235" target="_blank" >RIV/49777513:23520/99:00043235 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Greedy triangulation improvement over lookahead search

Original language description

Minimum weight triangulation [MWT] is defined as a triangulation with the minimal total edge length on the given planar point set. It is unknown whethwe it can be computed in polynomial time. The greedy triangulation of planar points is used as a basis for most of MWT heuristics. The paper describes how the geedy triangulation can be umproved to reflect better the total edge length criterion. Improvement uses an already existing method of lookahead search.

Czech name

—

Czech description

—

Type

C - Chapter in a specialist book

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

1999

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Book/collection name

Greedy triangulation improvement over lookahead search

ISBN

8088922054

Number of pages of the result

6

Pages from-to

—

Number of pages of the book

—

Publisher name

Technická univerzita

Place of publication

Košice

UT code for WoS chapter

—