![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 58 matches
- 2006
- Yaniv Altshuler, Vladimir Yanovski, Daniel Vainsencher, Israel A. Wagner, Alfred M. Bruckstein
:
On Minimal Perimeter Polyminoes. DGCI 2006: 17-28 - Carlo Arcelli, Gabriella Sanniti di Baja, Luca Serino:
New Removal Operators for Surface Skeletonization. DGCI 2006: 555-566 - Xiang Bai, Longin Jan Latecki
, Wenyu Liu:
Skeleton Pruning by Contour Partitioning. DGCI 2006: 567-579 - Péter Balázs:
The Number of Line-Convex Directed Polyominoes Having the Same Orthogonal Projections. DGCI 2006: 77-85 - Kees Joost Batenburg:
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections. DGCI 2006: 86-97 - Gilles Bertrand, Michel Couprie:
A New 3D Parallel Thinning Scheme Based on Critical Kernels. DGCI 2006: 580-591 - Olivier Bodini, Sandrine Lefranc:
How to Tile by Dominoes the Boundary of a Polycube. DGCI 2006: 630-638 - Valentin E. Brimkov, Davide Moroni, Reneta P. Barneva:
Combinatorial Relations for Digital Pictures. DGCI 2006: 189-198 - Srecko Brlek, Xavier Provençal:
An Optimal Algorithm for Detecting Pseudo-squares. DGCI 2006: 403-412 - Sara Brunetti
, Alain Daurat, Attila Kuba:
Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets. DGCI 2006: 98-109 - Lilian Buzer:
A Composite and Quasi Linear Time Method for Digital Plane Recognition. DGCI 2006: 331-342 - Bruno M. Carvalho
, Lucas M. Oliveira, Gilbran S. Andrade:
Fuzzy Segmentation of Color Video Shots. DGCI 2006: 494-505 - Jean-Marc Chassery, David Coeurjolly, Isabelle Sivignon:
Duality and Geometry Straightness, Characterization and Envelope. DGCI 2006: 1-16 - David Coeurjolly, Florent Dupont
, Laurent Jospin, Isabelle Sivignon:
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification. DGCI 2006: 413-424 - Jean Cousty, Gilles Bertrand
, Michel Couprie, Laurent Najman
:
Fusion Graphs, Region Merging and Watersheds. DGCI 2006: 343-354 - Martine Dexet, Eric Andres:
A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition. DGCI 2006: 639-650 - M. A. M. M. van Dortmont, Huub M. M. van de Wetering
, Alexandru C. Telea:
Skeletonization and Distance Transforms of 3D Volumes Using Graphics Hardware. DGCI 2006: 617-629 - Timothée Faucon, Etienne Decencière, Cédric Magneron:
Application of Surface Topological Segmentation to Seismic Imaging. DGCI 2006: 506-517 - Fabien Feschet, Jean-Pierre Reveillès:
A Generic Approach for n-Dimensional Digital Lines. DGCI 2006: 29-40 - Christophe Fiorio, Jean-Luc Toutant:
Arithmetic Discrete Hyperspheres and Separatingness. DGCI 2006: 425-436 - Céline Fouard
, Magnus Gedda:
An Objective Comparison Between Gray Weighted Distance Transforms and Weighted Distance Transforms on Curved Spaces. DGCI 2006: 259-270 - Vasily Goncharenko, Alexander Tuzikov:
Watershed Segmentation with Chamfer Metric. DGCI 2006: 518-529 - Rocío González-Díaz, Belén Medrano, Javier Sánchez-Peláez, Pedro Real
:
Reusing Integer Homology Information of Binary Digital Images. DGCI 2006: 199-210 - Carine Grasset-Simon, Guillaume Damiand:
Generalized Map Pyramid for Multi-level 3D Image Segmentation. DGCI 2006: 530-541 - András Hajdu, Lajos Hajdu:
On the Lattice Structure of Subsets of Octagonal Neighborhood Sequences in \mathbb Zn. DGCI 2006: 211-222 - Jérôme Hulin, Edouard Thiel:
Chordal Axis on Weighted Distance Transforms. DGCI 2006: 271-282 - Leena Ikonen, Toni Kuparinen, Eduardo Villanueva, Pekka J. Toivanen:
Distance Transforms on Anisotropic Surfaces for Surface Roughness Measurement. DGCI 2006: 651-662 - Marcin Iwanowski, Pierre Soille:
Order Independence in Binary 2D Homotopic Thinning. DGCI 2006: 592-604 - Damien Jamet, Jean-Luc Toutant:
On the Connectedness of Rational Arithmetic Discrete Hyperplanes. DGCI 2006: 223-234 - Akira Kaneko, Rina Nagahama:
Reconstruction Algorithm and Switching Graph for Two-Projection Tomography with Prohibited Subregion. DGCI 2006: 110-121
skipping 28 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.
retrieved on 2025-02-16 20:12 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint