Borut Žalik

Available identifiers

Publication	Date of Publication	Type
A framework for detecting communities of unbalanced sizes in networks	2022-06-27	Paper
Can Burrows-Wheeler transform be replaced in chain code compression?	2021-04-19	Paper
Efficient chain code compression with interpolative coding	2020-09-08	Paper
Extended algorithm to construct a quadtree from Freeman chain code in four directions	2020-03-06	Paper
An efficient eigenspace updating scheme for high-dimensional systems	2014-07-28	Paper
The stochastic walk algorithms for point location in pseudo-triangulations	2011-08-02	Paper
An efficient raster font compression for embedded systems	2010-11-30	Paper
A sweep-line algorithm for spatial clustering	2009-04-03	Paper
A practical approach to the 2D incremental nearest-point problem suitable for different point distributions	2007-11-07	Paper
https://portal.mardi4nfdi.de/entity/Q5421865	2007-10-24	Paper
Compressed vertex chain codes	2007-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q5482926	2006-08-15	Paper
A fast algorithm for an envelope construction of a huge set of topologically consistent polygons	2005-12-08	Paper
On The Lower Bound Of Edge Guards Of Polyhedral Terrains	2004-02-11	Paper
Low cost energy analyser of beings	2002-10-10	Paper
Quasi-regular tessellation of hexagons	2002-01-30	Paper
A contribution to triangulation algorithms for simple polygons	2001-11-19	Paper
A topology construction from line drawings using a uniform plane subdivision technique.	1999-01-01	Paper

This page was built for person: Borut Žalik