default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Gribov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c16]Alexander Gribov, Khalid Duri:
Reconstruction of Power Lines from Point Clouds. ICDAR Workshops (1) 2023: 105-119- 2022
- [i5]Alexander Gribov, Khalid Duri:
Reconstruction of Power Lines from Point Clouds. CoRR abs/2201.12499 (2022)
2010 – 2019
- 2019
- [c15]Alexander Gribov:
Optimal Compression of a Polyline While Aligning to Preferred Directions. GREC@ICDAR 2019: 98-102 - 2018
- [i4]Alexander Gribov:
An Efficient Combinatorial Algorithm for Optimal Compression of a Polyline with Segments and Arcs. CoRR abs/1811.05659 (2018) - 2017
- [c14]Alexander Gribov:
Searching for a Compressed Polyline with a Minimum Number of Vertices (Discrete Solution). GREC 2017: 54-68 - [c13]Alexander Gribov:
An Efficient Combinatorial Algorithm for Optimal Compression of a Polyline with Segments and Arcs. GREC@ICDAR 2017: 7-8 - [c12]Alexander Gribov:
Searching for a Compressed Polyline with a Minimum Number of Vertices. GREC@ICDAR 2017: 13-14 - [c11]Alexander Gribov:
Approximate Fitting a Circular Arc When Two Points Are Known. GREC@ICDAR 2017: 15-16 - 2016
- [i3]Alexander Gribov:
Optimal Compression of a Polyline with Segments and Arcs. CoRR abs/1604.07476 (2016) - 2015
- [i2]Alexander Gribov:
Approximate Fitting of Circular Arcs when Two Points are Known. CoRR abs/1504.06582 (2015) - [i1]Alexander Gribov:
Searching for a Compressed Polyline with a Minimum Number of Vertices. CoRR abs/1504.06584 (2015) - 2012
- [j1]Alexander Pilhofer, Alexander Gribov, Antony Unwin:
Comparing Clusterings Using Bertin's Idea. IEEE Trans. Vis. Comput. Graph. 18(12): 2506-2515 (2012)
2000 – 2009
- 2007
- [c10]Alexander Gribov, Eugene Bodansky:
Smoothing a Network of Planar Polygonal Lines Obtained with Vectorization. GREC 2007: 213-234 - 2006
- [c9]Alexander Gribov, Eugene Bodansky:
Reconstruction of Orthogonal Polygonal Lines. Document Analysis Systems 2006: 462-473 - [c8]Eugene Bodansky, Alexander Gribov:
Approximation of a Polyline with a Sequence of Geometric Primitives. ICIAR (2) 2006: 468-478 - 2005
- [c7]Alexander Gribov, Eugene Bodansky:
Vectorization and Parity Errors. GREC 2005: 1-10 - 2004
- [c6]Alexander Gribov, Eugene Bodansky:
A New Method of Polyline Approximation. SSPR/SPR 2004: 504-511 - 2003
- [c5]Alexander Gribov, Eugene Bodansky:
Automatic Measuring the Local Thickness of Raster Lines. GREC 2003: 188-192 - [c4]Eugene Bodansky, Alexander Gribov:
Approximation of Polylines With Circular Arcs. GREC 2003: 193-198 - [c3]Alexander Gribov, Eugene Bodansky:
Vectorization with the Voronoi L-diagram. ICDAR 2003: 1015-1019 - 2002
- [c2]Eugene Bodansky, Alexander Gribov:
Closing Gaps of Discontinuous Lines: A New Criterion for Choosing the Best Prolongation. Document Analysis Systems 2002: 119-122 - 2001
- [c1]Eugene Bodansky, Alexander Gribov, Morakot Pilouk:
Smoothing and Compression of Lines Obtained by Raster-to-Vector Conversion. GREC 2001: 256-265
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
