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 19 matches
- 2022
- Eleonor Ciurea, Oana Georgescu, Camelia Schiopu:
Minimum Flows in Directed 1-n Planar Static and Dynamic Networks with Arcs and Nodes Capacities. J. Circuits Syst. Comput. 31(7): 2230004:1-2230004:19 (2022) - 2018
- Simeon Ball, Michel Lavrauw:
Planar arcs. J. Comb. Theory A 160: 261-287 (2018) - Eleonor Ciurea, Oana Georgescu, Camelia Schiopu:
Minimum flows in directed s-t planar networks with arcs and nodes capacities. CoDIT 2018: 110-115 - 2017
- Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert:
Finding All Useless Arcs in Directed Planar Graphs. CoRR abs/1702.04786 (2017) - 2015
- Jaewook Lee, Yong-Joon Kim, Myung-Soo Kim, Gershon Elber:
Efficient offset trimming for deformable planar curves using a dynamic hierarchy of bounding circular arcs. Comput. Aided Des. 58: 248-255 (2015) - 2014
- Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - 2013
- Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - 2010
- Paul Frihauf, Miroslav Krstic:
Multi-agent deployment to a family of planar Arcs. ACC 2010: 4109-4114 - 2008
- Francesco Tortorella, Rossella Patraccone, Mario Molinara:
A Dynamic Programming approach for segmenting digital planar curves into line segments and circular arcs. ICPR 2008: 1-4 - 2005
- Wu-Chih Hu:
Multiprimitive segmentation based on meaningful breakpoints for fitting digital planar curves with line segments and conic arcs. Image Vis. Comput. 23(9): 783-789 (2005) - 2003
- Ji-Hwei Horng:
An adaptive smoothing approach for fitting digital planar curves with line segments and circular arcs. Pattern Recognit. Lett. 24(1-3): 565-577 (2003) - 2001
- C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Drawing Planar Graphs with Circular Arcs. Discret. Comput. Geom. 25(3): 405-418 (2001) - Ji-Hwei Horng, Johnny Tienyi Li:
A dynamic programming approach for fitting digital planar curves with line segments and circular arcs. Pattern Recognit. Lett. 22(2): 183-197 (2001) - 1999
- C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Drawing Planar Graphs with Circular Arcs. GD 1999: 117-126 - 1997
- Wenhua Wan, José A. Ventura:
Segmentation of Planar Curves into Straight-Line Segments and Elliptical Arcs. CVGIP Graph. Model. Image Process. 59(6): 484-494 (1997) - 1996
- Jen-Ming Chen, José A. Ventura, Chih-Hang Wu:
Segmentation of planar curves into circular arcs and line segments. Image Vis. Comput. 14(1): 71-83 (1996) - Soo-Chang Pei, Ji-Hwei Horng:
Optimum approximation of digital planar curves using circular arcs. Pattern Recognit. 29(3): 383-388 (1996) - 1994
- Fridrich Sloboda, Bedrich Zat'ko:
Piecewise Linear Approximation of Planar Jordan Curves and Arcs: Theory and Applications. Theoretical Foundations of Computer Vision 1994: 183-199 - 1984
- Ian M. Anderson, James C. Bezdek:
Curvature and Tangential Deflection of Discrete Arcs: A Theory Based on the Commutator of Scatter Matrix Pairs and Its Application to Vertex Detection in Planar Shape Data. IEEE Trans. Pattern Anal. Mach. Intell. 6(1): 27-40 (1984)
loading more results
failed to load more results, please try again later
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 2024-09-21 17:07 CEST 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