| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju


1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
An almost distribution-independent incremental Delaunay triangulation algorithm
Mirko Zadravec, Borut Žalik, 2005, izvirni znanstveni članek

Opis: This paper presents a new incremental insertion algorithm for constructing a Delaunay triangulation. Firstly, the nearest point is found in order to speed up the location of a triangle containing a currently inserted point. A hash table and 1-3 deterministic skip lists, combined with a walking strategy, are used for this task. The obtained algorithm is compared with the most popular Delaunay triangulation algorithms. The algorithm has the following attractive features: it is fast and practically independent of the distribution of input points, it is not memory demanding, and it is numerically stable and easy to implement.
Ključne besede: Delaunay triangulation, incremental algorithm, computational geometry, skip list, hash table
Objavljeno: 01.06.2012; Ogledov: 1194; Prenosov: 56
URL Povezava na celotno besedilo

Representation of Boolean functions with ROBDDs
Aleš Časar, Robert Meolic, samostojni znanstveni sestavek ali poglavje v monografski publikaciji

Opis: This paper describes data structures and algorithms for representation of Boolean functions with reduced ordered binary decision diagrams (ROBDDs). A hash table is used for quick search. Additional information about variables and functions is stored in binary trees. Manipulations on functions are based on a recursive algorithm of ITE operation. The primary goal of this article is describe programming technics needed to realize the idea. For the first time here recursive algorithms for composing functions and garbage collection with a formulae counter are presented. This is better than garbage collection in other known implementations. The results of the tests show that the described representation is very efficient in applications which operate with Boolean functions.
Ključne besede: Reduced Ordered Binary Decision Diagram, Boolean function, logic functions, logic design verification, hash table
Objavljeno: 02.02.2018; Ogledov: 891; Prenosov: 24
.pdf Celotno besedilo (323,32 KB)

Iskanje izvedeno v 0.08 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici