| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme


1 - 2 / 2
First pagePrevious page1Next pageLast page
Representation of Boolean functions with ROBDDs
Aleš Časar, Robert Meolic, independent scientific component part or a chapter in a monograph

Abstract: 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.
Keywords: Reduced Ordered Binary Decision Diagram, Boolean function, logic functions, logic design verification, hash table
Published: 02.02.2018; Views: 1380; Downloads: 32
.pdf Full text (323,32 KB)

An almost distribution-independent incremental Delaunay triangulation algorithm
Mirko Zadravec, Borut Žalik, 2005, original scientific article

Abstract: 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.
Keywords: Delaunay triangulation, incremental algorithm, computational geometry, skip list, hash table
Published: 01.06.2012; Views: 1554; Downloads: 80
URL Link to full text

Search done in 0.07 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica