Sciweavers

2980 search results - page 118 / 596
» Computational Geometry
Sort
View
DGCI
2009
Springer
15 years 1 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud
WETICE
1997
IEEE
15 years 2 months ago
Capturing Geometry Rationale for Collaborative Design
When an artifact is designed the typical output consists of documents describing the final result of a long series of deliberations and tradeoffs by the participants of collaborat...
Mark Klein
SMA
2008
ACM
136views Solid Modeling» more  SMA 2008»
14 years 10 months ago
Kinematic convexity of spherical displacements and its application to collision prediction
In recent years, there has been an increasing interest in developing geometric algorithms for kinematic computations. The aim of this paper is to present the notion of kinematic c...
Qiaode Jeffrey Ge, Anurag Purwar, Jun Wu
SIAMDM
2010
194views more  SIAMDM 2010»
14 years 4 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
CORR
2010
Springer
166views Education» more  CORR 2010»
14 years 8 months ago
Computer Aided Design Modeling for Heterogeneous Objects
Heterogeneous object design is an active research area in recent years. The conventional CAD modeling approaches only provide geometry and topology of the object, but do not conta...
Vikas Gupta, K. S. Kasana, Puneet Tandon