Остановите войну!
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 58 matches
- 1996
- Nancy M. Amato, Edgar A. Ramos:
On Computing Voronoi Diagrams by Divide-Prune-and-Conquer. SCG 1996: 166-175 - Nina Amenta:
Four-Polytopes and a Funeral (for my conjecture). SCG 1996: V-1-V-2 - Nina Amenta, Günter M. Ziegler:
Shadows and Slices of Polytopes. SCG 1996: 10-19 - Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
d1-Optimal Motion for a Rod (Extended Abstract). SCG 1996: 252-263 - David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. SCG 1996: C-11-C-12 - Chandrajit L. Bajaj, Valerio Pascucci:
Splitting a Complex of Convex Polytopes In Any Dimension. SCG 1996: 88-97 - James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
Animating Geometric Algorithms Over the Web. SCG 1996: C-3-C-4 - Gill Barequet, Matthew Dickerson, David Eppstein:
On Triangulating Three-Dimensional Polygons. SCG 1996: 38-47 - Gill Barequet, Micha Sharir:
Partial Surface Matching by Using Directed Footprints. SCG 1996: C-9-C-10 - Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink:
On Computing Edges That Are In All Minimum-Weight Triangulations. SCG 1996: V-7-V-8 - Mark de Berg, René van Oostrum, Mark H. Overmars:
Simple Traversal of a Subdivision Without Extra Storage. SCG 1996: C-5-C-6 - Guy E. Blelloch, Gary L. Miller, Dafna Talmor:
Developing a Practical Projection-Based Parallel Delaunay Algorithm. SCG 1996: 186-195 - Jean-Daniel Boissonnat, Sylvain Lazard:
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). SCG 1996: 242-251 - Timothy M. Chan:
Fixed-Dimensional Linear Programming Queries Made Easy. SCG 1996: 284-290 - Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Robust Algorithms for Constructing Strongly Convex Hulls. SCG 1996: 133-140 - Siu-Wing Cheng, Yin-Feng Xu:
Approaching the Largest beta-Skeleton within a Minimum Weight Triangulation. SCG 1996: 196-203 - Joonsoo Choi, Chee-Keng Yap:
Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). SCG 1996: 339-348 - Marek Chrobak, Michael T. Goodrich, Roberto Tamassia:
Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). SCG 1996: 319-328 - Satyan R. Coorg, Seth J. Teller:
Temporally Coherent Conservative Visibility (Extended Abstract). SCG 1996: 78-87 - Matthew Dickerson, Mark H. Montague:
A (Usually?) Connected Subgraph of the Minimum Weight Triangulation. SCG 1996: 204-213 - Matthew Dickerson, Daniel Scharstein:
The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. SCG 1996: V-9-V-10 - Frédo Durand, Rachel Orti, Stéphane Rivière, Claude Puech:
Radiosity in Flatland Made Visibly Simple: Using the Visibility Complex for Lighting Simulation of Dynamic Scenes in Flatland. SCG 1996: V-11-V-12 - Alon Efrat, Alon Itai:
Improvements on Bottleneck Matching and Related Problems Using Geometry. SCG 1996: 301-310 - David Eppstein:
Linear Complexity Hexahedral Mesh Generation. SCG 1996: 58-67 - Jeff Erickson:
New Lower Bounds for Convex Hull Problems in Odd Dimensions. SCG 1996: 1-9 - Stefan Felsner:
On the Number of Arrangements of Pseudolines. SCG 1996: 30-37 - Sherif Ghali, A. James Stewart:
Maintenance of the Set of Segments Visible from a Moving Viewpoint in Two Dimensions. SCG 1996: V-3-V-4 - Neelima Gupta, Sandeep Sen:
Faster Output-Sensitive Parallel Convex Hulls for d<=3: Optimal Sublogarithmic Algorithms for Small Outputs. SCG 1996: 176-185 - Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan:
Approximating Shortest Paths on a Convex Polytope in Three Dimensions. SCG 1996: 329-338 - Martin Held, James T. Klosowski, Joseph S. B. Mitchell:
Collision Detection for Fly-Throughs in Virtual Environments. SCG 1996: V-13-V-14
skipping 28 more matches
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-04-25 04:23 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