Sciweavers

57 search results - page 7 / 12
» Rotationally Monotone Polygons
Sort
View
CGF
2010
120views more  CGF 2010»
14 years 9 months ago
Polygonal mesh watermarking using Laplacian coordinates
We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x,y...
Ying Yang, Ioannis P. Ivrissimtzis
COMPGEOM
1990
ACM
15 years 1 months ago
Finding Compact Coordinate Representations for Polygons and Polyhedra
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
Victor Milenkovic, Lee R. Nackman
CCCG
2009
14 years 7 months ago
Wireless Localization with Vertex Guards is NP-hard
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
Tobias Christ, Michael Hoffmann
MOC
1998
144views more  MOC 1998»
14 years 9 months ago
Convergence of a random walk method for a partial differential equation
Abstract. A Cauchy problem for a one–dimensional diffusion–reaction equation is solved on a grid by a random walk method, in which the diffusion part is solved by random walk...
Weidong Lu
ETFA
2006
IEEE
15 years 3 months ago
Response-Time Analysis of tasks with offsets
Abstract— This article presents some results about schedulability analysis of tasks with offsets also known as transactions, in the particular case of monotonic transactions. The...
Karim Traore, Emmanuel Grolleau, Ahmed Rahni, Mich...