Остановите войну!
for scientists:
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 31 matches
- 1995
- Helmut Alt, David Hsu, Jack Snoeyink:
Computing the largest inscribed isothetic rectangle. CCCG 1995: 67-72 - Tetsuo Asano, Naoki Katoh, Elena Lodi, Thomas Roos:
Optimal approximation of monotone curves on a grid. CCCG 1995: 37-42 - Gill Barequet, Matthew Dickerson, Petru Pau:
Translating a convex polygon to contain maximum number of points. CCCG 1995: 61-66 - Patrice Belleville:
Convex covers in higher dimensions. CCCG 1995: 145-150 - Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Godfried T. Toussaint:
Aperture angle optimization problems. CCCG 1995: 73-78 - Leizhen Cai, Hazel Everett:
Visibility graphs of polygonal rings. CCCG 1995: 157-161 - Danny Z. Chen, Vladimir Estivill-Castro, Jorge Urrutia:
Optimal guarding of polygons and monotone chains. CCCG 1995: 133-138 - Danny Z. Chen, Kevin S. Klenk:
Rectilinear short path queries among rectangular obstacles. CCCG 1995: 169-174 - Christian Chenier, Jorge Urrutia:
Shortest paths in convex and simple weighted polygons. CCCG 1995: 175-179 - Paul Colley, Henk Meijer, David Rappaport:
Motivating lazy guards. CCCG 1995: 121-126 - Gautam Das, Giri Narasimhan:
Short cuts in higher dimensional space. CCCG 1995: 103-108 - Pascal Desnoguès, Olivier Devillers:
A locally optimal triangulation of the hyperbolic paraboloid. CCCG 1995: 49-54 - Tamal K. Dey, Nimish R. Shah:
On the number of simplicial complexes in Rd. CCCG 1995: 31-36 - Jeff Erickson:
On the relative complexities of some geometric problems. CCCG 1995: 85-90 - William Evans:
Regular polygons are most tolerant. CCCG 1995: 109-113 - Frank Follert:
Maxmin location of an anchored ray in 3-space and related problems. CCCG 1995: 7-12 - Frank Follert, Elmar Schömer, Jürgen Sellen:
Subquadratic algorithms for the weighted maximin facility location problem. CCCG 1995: 1-6 - Laxmi P. Gewali, Simeon C. Ntafos:
Watchman routes in the presence of a pair of convex polygons. CCCG 1995: 127-132 - Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink:
The complexity of a single face of a minkowski sum. CCCG 1995: 91-96 - Jian Huang, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
A note on approximations of rectilinear polygons. CCCG 1995: 43-48 - Jerzy W. Jaromczyk, Miroslaw Kowaluk:
A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem. CCCG 1995: 19-24 - Sung Kwon Kim:
Simple algorithms for orthogonal upward drawings of binary and ternary trees. CCCG 1995: 115-120 - Victor J. Milenkovic:
Practical methods for set operations on polygons using exact arithmetic. CCCG 1995: 55-60 - Victor Milenkovic:
Position based physics animating and packing spheres inside polyhedra. CCCG 1995: 79-84 - Joseph O'Rourke, Thomas C. Shermer, Ileana Streinu:
Illuminating convex polygonswith vertex floodlight. CCCG 1995: 151-156 - Alfredo García Olaverri, Marc Noy, Javier Tejel:
Lower bounds for the number noncrossing free subgraphs of Kn. CCCG 1995: 97-102 - Kathleen Romanik:
Directed rectangle visibility graphs have unbounded dimension. CCCG 1995: 163-167 - Nimish R. Shah:
Homeomorphic meshes in Rd. CCCG 1995: 25-30 - Kasturi R. Varadarajan, Pankaj K. Agarwal:
Linear approximation of simple objects. CCCG 1995: 13-18 - Siu-Ming Yiu:
A generalized fortress problem using k-consecutive vertex guards. CCCG 1995: 139-144
skipping 1 more match
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-05-28 01:57 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