Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 12
Volume 12, 1994
- János Pach, Jenö Töröcsik:
Some Geometric Applications of Dilworth's Theorem. 1-7 - Alberto Cavicchioli
, Beatrice Ruini:
Special Representations for n-Bridge Links. 9-27 - Boris Aronov, Marshall W. Bern, David Eppstein:
On the Number of Minimal 1-Steiner Trees. 29-34 - Alexander I. Barvinok:
Computing the Ehrhart Polynomial of a Convex Lattice Polytope. 35-48 - Keith A. Brandt, Hiroaki Terao:
Free Arrangements and Relation Spaces. 49-63 - G. Srinivasaraghavan, Asish Mukhopadhyay:
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons. 65-82 - Wlodzimierz Kuperberg:
On-Line Covering a Cube by a Sequence of Cubes. 83-90 - Evangelos Kranakis, Michel Pocchiola:
Camera Placement in Integer Lattices. 91-104 - Peter Doyle, Zheng-Xu He, Burt Rodin:
The Asymptotic Value of the Circle-Packing Rigidity Constants Sn. 105-116 - Boris Aronov, Micha Sharir:
Castles in the Air Revisited. 119-150 - Philippe Flajolet, T. Lafforgue:
Search Costs in Quadtrees and Singularity Perturbation Asymptotics. 151-175 - Pankaj K. Agarwal, Micha Sharir:
On the Number of Views of Polyhedral Terrains. 177-182 - Chuanming Zong:
An Example Concerning the Translative Kissing Number of Convex Body. 183-188 - V. T. Rajan:
Optimality of the Delaunay Triangulation in Rd. 189-202 - Marco Pellegrini:
On Lines Missing Polyhedral Sets in 3-Space. 203-221 - D. P. Robbins:
Areas of Polygons Inscribed in a Circle. 223-236 - Nina Amenta:
Helly-Type Theorems and Generalized Linear Programming. 241-261 - Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. 263-280 - Tamal K. Dey, Herbert Edelsbrunner:
Counting Triangle Crossing and Halving Planes. 231-289 - Shreesh Jadhav, Asish Mukhopadhyay:
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. 291-312 - Dan Halperin, Micha Sharir:
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. 313-326 - Micha Sharir:
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. 327-345 - Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri:
Can Visibility Graphs Be Represented Compactly?. 347-365 - Jack Snoeyink, Jorge Stolfi:
Objects that Cannot Be Taken Apart with Two Hands. 367-384 - Imre Bárány, Aladár Heppes:
On the Exact Constant i the Quantitative Steinitz Theorem in the Plane. 387-398 - Bernd Gärtner, Emo Welzl:
Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. 399-432 - Janusz Januszewski, Marek Lassak:
On-line Covering the Unit Cube by Cubes. 433-438 - György Elekes:
Generalized Breadths, Circular Cantor Sets, and the Least Area UCC. 439-449 - Emilio Bujalance García, Antonio F. Costa, José Manuel Gamboa Mutuberría, Javier Lafuente López:
An Algorithm to Compute Odd Orders and Ramification Indices of Cyclic Actions on Compact Surfaces. 451-464 - E. Steigrímsson:
A Decomposition of 2-Weak Vertex-packing Polytopes. 465-479
a service of 
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.
last updated on 2024-08-30 20:48 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:
