Sciweavers

14850 search results - page 43 / 2970
» A Geometric Approach to Betweenness
Sort
View
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
13 years 8 months ago
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
IV
2002
IEEE
124views Visualization» more  IV 2002»
14 years 1 months ago
Numerical Solving of Geometric Constraints
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
Samy Ait-Aoudia
ENTCS
2006
116views more  ENTCS 2006»
13 years 8 months ago
Reflections on a Geometry of Processes
In this note we discuss some issues concerning a geometric approach to process algebra. We mainly raise questions and are not yet able to present significant answers.
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
SMA
2009
ACM
117views Solid Modeling» more  SMA 2009»
14 years 3 months ago
Discrete physics using metrized chains
Over the last fifty years, there have been numerous efforts to develop from first principles a comprehensive discrete formulation of geometric physics, including Whitney’s ge...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
GD
1998
Springer
14 years 1 months ago
Geometric Thickness of Complete Graphs
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
Michael B. Dillencourt, David Eppstein, Daniel S. ...