| | 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

Options:
  Reset


1 - 5 / 5
First pagePrevious page1Next pageLast page
1.
Dealing with redundancy and inconsistency in constructive geometric constraint solving
David Podgorelec, Borut Žalik, Vid Domiter, 2008, original scientific article

Abstract: General constructive geometric constraint solvers are pre-processed by a degree-of-freedom analysis, which enables efficient graph decomposition and recombination. However, all these methods are based on the assumption that structural rigidity automatically assures solvability. In this paper, we show that this assumption fails in numerous, even the most basic, configurations. We introduce several simple but efficient rules aimed to additionally analyse solvability in such cases. Another novelty addresses conditional constraints between three or more geometric parts, rules for their simplification and a redundancy check. All these functionalities are built into our original 2D geometric constraint solver, based on concepts of rigid clusters and constrained-angle (CA) sets.
Keywords: geometric constraint solving, computer-aided design, constructive approach, redundant constraints
Published in DKUM: 31.05.2012; Views: 1727; Downloads: 114
URL Link to full text

2.
A general simplification algorithm
Boštjan Pivec, Vid Domiter, 2007, original scientific article

Abstract: In this article a new general algorithm for triangular mesh simplification is proposed. The algorithm extends Krivograd's work from 2D to 3D. For faster execution times a hash table is used. The main idea of the algorithm is based on vertex removal approach. With this approach we remove visually less important vertices. To determine their visual importance, all vertices have tobe evaluated. This way models still preserve their essential characteristics. With simplification we can also easily present and transfer models over the network.
Keywords: geometric modeling, triangular meshes, simplification, algorithms
Published in DKUM: 31.05.2012; Views: 2255; Downloads: 55
URL Link to full text

3.
MODNO NAČRTOVANJE V CINEMA 4D
Martina Čeh Ambruš, 2010, bachelor thesis/paper

Abstract: Cilj diplomske naloge je preučiti in pokazati možnosti oblikovanja oblačil v orodju Cinema 4D ter pokazati uporabnost in učinkovitost orodja na tem področju. Pokazali smo, da lahko z orodjem, ki ni izključno namenjeno modni industriji in oblikovanju oblačil, oblikujemo nova oblačila na preprost in hiter način, ter s tem podpremo klasično modno načrtovanje in oblikovanje. Velika prednost računalniškega modeliranja je, da lahko v času modeliranja dobivamo nove ideje, jih realiziramo in takoj vidimo njihove učinke, kar nam odpre nove možnosti pri načrtovanju oblačil. 3D modeliranje oblačil je vsekakor prihodnost (in tudi že sedanjost) modne industrije.
Keywords: Cinema 4D, 3D modeliranje, virtualna oblačila, modno oblikovanje
Published in DKUM: 05.01.2011; Views: 8883; Downloads: 260
.pdf Full text (1,51 MB)

4.
ALGORITMI TRIANGULACIJE S STRATEGIJO PREBIRANJA
Vid Domiter, 2009, dissertation

Abstract: Osnovni cilj doktorske naloge je razviti lasten postopek omejene Delaunayeve triangulacije z metodo prebiranja, ki bo vsaj enako učinkovit kot do sedaj razviti postopki in pokazati, da je s prebiranjem možno rešiti tudi veliko težjo nalogo rekonstrukcije površja v 3D. V nalogi najprej definiramo klasično in omejeno Delaunayevo triangulacijo, opišemo obstoječe postopke, nato pa se osredotočimo na lasten postopek omejene Delaunayeve triangulacije. Podrobneje opišemo njegovo delovanje in razširitve, ki vodijo k učinkovitemu algoritmu omejene Delaunayeve triangulacije. Temelj algoritma je pomikanje napredujoče fronte s prebirno premico in razvoj hevristik, ki poskrbijo za uspešno vodenje napredujoče fronte in hkrati minimizirajo število menjav trikotnikov. Nato preidemo na problem rekonstrukcije površja, kjer podamo pregled sorodnih raziskav. Dva postopka podrobneje opišemo, temu pa sledi opis lastnega postopka rekonstrukcije površja s prebiranjem. Algoritem temelji na širitvi napredujočih front s pomikanjem prebirne ravnine in hevristikah za uspešno upravljanje s frontami. Na koncu analiziramo oba razvita algoritma in potrdimo zastavljeni hipotezi.
Keywords: algoritmi, računalniška geometrija, računalniška grafika, CAD, prebiranje, trikotniške mreže, triangulacija, rekonstrukcija površja
Published in DKUM: 07.05.2009; Views: 3922; Downloads: 296
.pdf Full text (4,57 MB)

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