| 2009 |
|---|
| 34 | EE | Krista Rizman Zalik,
Borut Zalik:
A sweep-line algorithm for spatial clustering.
Advances in Engineering Software 40(6): 445-451 (2009) |
| 2008 |
|---|
| 33 | EE | Yong Kui Liu,
Jian Yun,
Xiao Niu Li,
Borut Zalik:
An efficient approximation of arbitrary curves and surfaces using intersecting polylines and meshes.
Advances in Engineering Software 39(6): 535-539 (2008) |
| 32 | EE | David Podgorelec,
Borut Zalik,
Vid Domiter:
Dealing with redundancy and inconsistency in constructive geometric constraint solving.
Advances in Engineering Software 39(9): 770-786 (2008) |
| 31 | EE | Yong Kui Liu,
H. Y. Song,
Borut Zalik:
A General Multi-step Algorithm for Voxel Traversing Along a Line.
Comput. Graph. Forum 27(1): 73-80 (2008) |
| 30 | EE | Sebastian Krivograd,
Mladen Trlep,
Borut Zalik:
A hexahedral mesh connectivity compression with vertex degrees.
Computer-Aided Design 40(12): 1105-1112 (2008) |
| 29 | EE | Vid Domiter,
Borut Zalik:
Sweep-line algorithm for constrained Delaunay triangulation.
International Journal of Geographical Information Science 22(4): 449-462 (2008) |
| 28 | EE | Gregor Klajnsek,
Borut Zalik,
Franc Novak,
Gregor Papa:
A Quadtree-based Progressive Lossless Compression Technique for Volumetric Data Sets.
J. Inf. Sci. Eng. 24(4): 1187-1195 (2008) |
| 27 | EE | Mirko Zadravec,
Andrej Brodnik,
Markus Mannila,
Merja Wanne,
Borut Zalik:
A practical approach to the 2D incremental nearest-point problem suitable for different point distributions.
Pattern Recognition 41(2): 646-653 (2008) |
| 2007 |
|---|
| 26 | EE | Yong Kui Liu,
Wei Wei,
Peng Jie Wang,
Borut Zalik:
Compressed vertex chain codes.
Pattern Recognition 40(11): 2908-2913 (2007) |
| 2005 |
|---|
| 25 | EE | Borut Zalik:
An efficient sweep-line Delaunay triangulation algorithm.
Computer-Aided Design 37(10): 1027-1038 (2005) |
| 24 | EE | Yong Kui Liu,
Borut Zalik:
An efficient chain code with Huffman coding.
Pattern Recognition 38(4): 553-557 (2005) |
| 23 | EE | Mirko Zadravec,
Borut Zalik:
An almost distribution-independent incremental Delaunay triangulation algorithm.
The Visual Computer 21(6): 384-396 (2005) |
| 2004 |
|---|
| 22 | EE | Yong Kui Liu,
Borut Zalik,
H. Yang:
An Integer One-Pass Algorithm for Voxel Traversal.
Comput. Graph. Forum 23(2): 167-172 (2004) |
| 21 | EE | Branko Kaucic,
Borut Zalik:
K-guarding of polyhedral terrain.
International Journal of Geographical Information Science 18(7): 709-718 (2004) |
| 2003 |
|---|
| 20 | EE | Marko Lamot,
Borut Zalik:
A fast polygon triangulation algorithm based on uniform plane subdivision.
Computers & Graphics 27(2): 239-253 (2003) |
| 19 | EE | Borut Zalik,
A. Jezernik,
K. Rizmanzalik:
Polygon trapezoidation by sets of open trapezoids.
Computers & Graphics 27(5): 791-800 (2003) |
| 18 | EE | Borut Zalik:
A fast algorithm for an envelope construction of a huge set of topologically consistent polygons.
Eng. Comput. (Lond.) 19(1): 35-44 (2003) |
| 17 | EE | Branko Kaucic,
Borut Zalik,
Franc Novak:
On the Lower Bound of Edge Guards of Polyhedral Terrains.
Int. J. Comput. Math. 80(7): 811-814 (2003) |
| 16 | EE | Borut Zalik,
Ivana Kolingerová:
An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm.
International Journal of Geographical Information Science 17(2): 119-138 (2003) |
| 15 | EE | Matej Gombosi,
Borut Zalik,
Sebastian Krivograd:
Comparing two sets of polygons.
International Journal of Geographical Information Science 17(5): 431-443 (2003) |
| 2002 |
|---|
| 14 | EE | Branko Kaucic,
Borut Zalik:
An Overview of Visibility Problem Algorithms in 1, 5D.
WSCG 2002: 241-248 |
| 13 | EE | Ivana Kolingerová,
Borut Zalik:
Improvements to randomized incremental Delaunay insertion.
Computers & Graphics 26(3): 477-490 (2002) |
| 2001 |
|---|
| 12 | EE | David Podgorelec,
Borut Zalik:
A Geometric Constraint Solver with Decomposable Constraint Set.
WSCG 2001: 222-229 |
| 11 | EE | Borut Zalik:
Merging a set of polygons.
Computers & Graphics 25(1): 77-88 (2001) |
| 2000 |
|---|
| 10 | EE | Fiaz Hussain,
Borut Zalik,
Simon Kolmanic:
Intelligent Digitization of Arabic Characters.
IV 2000: 337-342 |
| 1999 |
|---|
| 9 | EE | Marko Lamot,
Borut Zalik:
An Overview of Triangulation Algorithms for Simple Polygons.
IV 1999: 153- |
| 8 | EE | Fiaz Hussain,
Borut Zalik:
Towards a Feature-Based Interactive System for Intelligent Font Design.
IV 1999: 378-383 |
| 7 | EE | Borut Zalik:
A topology construction from line drawings using a uniform plane subdivision technique.
Computer-Aided Design 31(5): 335-348 (1999) |
| 6 | EE | Borut Zalik,
Gordon Clapworthy:
A universal trapezoidation algorithm for planar polygons.
Computers & Graphics 23(3): 353-363 (1999) |
| 1997 |
|---|
| 5 | | Borut Zalik,
Gordon Clapworthy,
Crtomir Oblonsek:
An Efficient Code-Based Voxel-Traversing Algorithm.
Comput. Graph. Forum 16(2): 119-128 (1997) |
| 1996 |
|---|
| 4 | | Borut Zalik:
An Interactive Constraint-Based Graphics System with Partially Constrained Form-Features.
CADUI 1996: 229-246 |
| 1995 |
|---|
| 3 | EE | Nikola Guid,
Crtomir Oblonsek,
Borut Zalik:
Surface interrogation methods.
Computers & Graphics 19(4): 557-574 (1995) |
| 1992 |
|---|
| 2 | | Borut Zalik,
Nikola Guid,
Aleksander Vesel:
Representing Geometric Objects Using Constraint Description Graphs.
IEA/AIE 1992: 505-514 |
| 1 | | Borut Zalik,
Nikola Guid,
Aleksander Vesel:
Parametric Design Using Constraint Description Graph.
Rechnerunterstütztes Entwerfen und Konstruieren (CAD) 1992: 329-344 |
