Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Barequet, Gill - Department of Computer Science, Technion, Israel Institute of Technology
A LOWER BOUND FOR HEILBRONN'S TRIANGLE PROBLEM IN d GILL BAREQUET
IMAGE FLOWS AND ONE-LINER GRAPHICAL IMAGE
Covering Points with a Polygon Yuval Scharf
A FRAMEWORK FOR SURFACE RECONSTRUCTION OF SPARSELY-SAMPLED OBJECTS
General Techniques for Interpolation, Reconstruction,
Discrete Mathematics 283 (2004) 714 www.elsevier.com/locate/disc
Matrix Cover29 :size, stranded33
Counting Polyominoes in Two and Three Micha Moffie
MORPHING BETWEEN GEOMETRIC SHAPES USING
Offset Polygon and Annulus Placement Problems
2-Point Site Voronoi Diagrams David Hodorkovsky
d-Dimensional Variants of Heilbronn's Triangle Problem
Polygon Reconstruction from Line Cross-Sections
NONLINEAR INTERPOLATION BETWEEN SLICES RESEARCH THESIS
The On-Line Heilbronn's Triangle Problem in d Dimensions
Discrete Mathematics 36 (1981) 191-203 North-Holland Publishing Company
Discrete Mathematics 309 (2009) 45764583 Contents lists available at ScienceDirect
Journal of Statistical Physics, Vol. 102, Nos. 34, 2001 Enumerations of Lattice Animals and Trees
Counting Polyominoes: A Parallel Implementation for Cluster Computing
Programming Contest Tuesday, August 8, 2006
COUNTING PROBLEMS FOR GEOMETRIC STRUCTURES
Matability of Polygons Aya Steiner
Algorithms for Heilbronn's Triangle Problem Asenath Tal
DOI: 10.1007/s00454-007-1323-x Discrete Comput Geom 38:5160 (2007) Discrete & Computational
Applications of Geometric Hashing to the Repair,
ANIMATING A CAMERA FOR VIEWING A PLANAR POLYGON
Maximizing the Area of an Axially-Symmetric Polygon
