Sciweavers

1387 search results - page 121 / 278
» Convexity in Discrete Space
Sort
View
DGCI
2000
Springer
14 years 2 months ago
A New Means for Investigating 3-Manifolds
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...
Vladimir Kovalevsky
COMPGEOM
1996
ACM
14 years 2 months ago
Smallest Enclosing Cylinders
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
Elmar Schömer, Jürgen Sellen, Marek Teic...
COMPGEOM
1991
ACM
14 years 1 months ago
The Two Guards Problem
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
Christian Icking, Rolf Klein
APIN
2004
131views more  APIN 2004»
13 years 10 months ago
Rough Self Organizing Map
A rough self-organizing map (RSOM) with fuzzy discretization of feature space is described here. Discernibility reducts obtained using rough set theory are used to extract domain k...
Sankar K. Pal, Biswarup Dasgupta, Pabitra Mitra
MOC
1998
90views more  MOC 1998»
13 years 9 months ago
Numerical solution of parabolic integro-differential equations by the discontinuous Galerkin method
The numerical solution of a parabolic equation with memory is considered. The equation is first discretized in time by means of the discontinuous Galerkin method with piecewise co...
Stig Larsson, Vidar Thomée, Lars B. Wahlbin