The SCEAS System
Navigation Menu

Search the dblp DataBase


Borut Zalik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Borut Zalik, Nikola Guid, Aleksander Vesel
    Parametric Design Using Constraint Description Graph. [Citation Graph (0, 0)][DBLP]
    Rechnerunterstütztes Entwerfen und Konstruieren (CAD), 1992, pp:329-344 [Conf]
  2. Borut Zalik
    An Interactive Constraint-Based Graphics System with Partially Constrained Form-Features. [Citation Graph (0, 0)][DBLP]
    CADUI, 1996, pp:229-246 [Conf]
  3. Borut Zalik, Nikola Guid, Aleksander Vesel
    Representing Geometric Objects Using Constraint Description Graphs. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 1992, pp:505-514 [Conf]
  4. Fiaz Hussain, Borut Zalik
    Towards a Feature-Based Interactive System for Intelligent Font Design. [Citation Graph (0, 0)][DBLP]
    IV, 1999, pp:378-383 [Conf]
  5. Fiaz Hussain, Borut Zalik, Simon Kolmanic
    Intelligent Digitization of Arabic Characters. [Citation Graph (0, 0)][DBLP]
    IV, 2000, pp:337-342 [Conf]
  6. Marko Lamot, Borut Zalik
    An Overview of Triangulation Algorithms for Simple Polygons. [Citation Graph (0, 0)][DBLP]
    IV, 1999, pp:153-0 [Conf]
  7. Branko Kaucic, Borut Zalik
    An Overview of Visibility Problem Algorithms in 1, 5D. [Citation Graph (0, 0)][DBLP]
    WSCG, 2002, pp:241-248 [Conf]
  8. D. Podgorelec, B. Zalik
    A Geometric Constraint Solver with Decomposable Constraint Set. [Citation Graph (0, 0)][DBLP]
    WSCG, 2001, pp:222-229 [Conf]
  9. Borut Zalik
    An efficient sweep-line Delaunay triangulation algorithm. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2005, v:37, n:10, pp:1027-1038 [Journal]
  10. Borut Zalik
    A topology construction from line drawings using a uniform plane subdivision technique. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1999, v:31, n:5, pp:335-348 [Journal]
  11. Nikola Guid, Crtomir Oblonsek, Borut Zalik
    Surface interrogation methods. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 1995, v:19, n:4, pp:557-574 [Journal]
  12. Ivana Kolingerová, Borut Zalik
    Improvements to randomized incremental Delaunay insertion. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 2002, v:26, n:3, pp:477-490 [Journal]
  13. Marko Lamot, Borut Zalik
    A fast polygon triangulation algorithm based on uniform plane subdivision. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 2003, v:27, n:2, pp:239-253 [Journal]
  14. Borut Zalik
    Merging a set of polygons. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 2001, v:25, n:1, pp:77-88 [Journal]
  15. Borut Zalik, Gordon Clapworthy
    A universal trapezoidation algorithm for planar polygons. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 1999, v:23, n:3, pp:353-363 [Journal]
  16. Borut Zalik, A. Jezernik, K. Rizmanzalik
    Polygon trapezoidation by sets of open trapezoids. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 2003, v:27, n:5, pp:791-800 [Journal]
  17. Yong Kui Liu, Borut Zalik, H. Yang
    An Integer One-Pass Algorithm for Voxel Traversal. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 2004, v:23, n:2, pp:167-172 [Journal]
  18. Borut Zalik, Gordon Clapworthy, Crtomir Oblonsek
    An Efficient Code-Based Voxel-Traversing Algorithm. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 1997, v:16, n:2, pp:119-128 [Journal]
  19. Borut Zalik
    A fast algorithm for an envelope construction of a huge set of topologically consistent polygons. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2003, v:19, n:1, pp:35-44 [Journal]
  20. Matej Gombosi, Borut Zalik, Sebastian Krivograd
    Comparing two sets of polygons. [Citation Graph (0, 0)][DBLP]
    International Journal of Geographical Information Science, 2003, v:17, n:5, pp:431-443 [Journal]
  21. Branko Kaucic, Borut Zalik
    K-guarding of polyhedral terrain. [Citation Graph (0, 0)][DBLP]
    International Journal of Geographical Information Science, 2004, v:18, n:7, pp:709-718 [Journal]
  22. Borut Zalik, Ivana Kolingerová
    An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm. [Citation Graph (0, 0)][DBLP]
    International Journal of Geographical Information Science, 2003, v:17, n:2, pp:119-138 [Journal]
  23. Branko Kaucic, Borut Zalik, Franc Novak
    On the Lower Bound of Edge Guards of Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2003, v:80, n:7, pp:811-814 [Journal]
  24. Yong Kui Liu, Borut Zalik
    An efficient chain code with Huffman coding. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2005, v:38, n:4, pp:553-557 [Journal]
  25. Mirko Zadravec, Borut Zalik
    An almost distribution-independent incremental Delaunay triangulation algorithm. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 2005, v:21, n:6, pp:384-396 [Journal]
  26. Yong Kui Liu, Wei Wei, Peng Jie Wang, Borut Zalik
    Compressed vertex chain codes. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2007, v:40, n:11, pp:2908-2913 [Journal]
  27. 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. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2008, v:41, n:2, pp:646-653 [Journal]

  28. Determination of Prediction Functions for Lossless Image Compression Using Genetic Algorithm. [Citation Graph (, )][DBLP]

  29. A hexahedral mesh connectivity compression with vertex degrees. [Citation Graph (, )][DBLP]

  30. A General Multi-step Algorithm for Voxel Traversing Along a Line. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002