An algorithm reconstructing convex lattice sets

Author： Brunetti S.   Daurat A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 35-57

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Digital Topology of Sets of Convex Voxels

By Saha P.K.   Rosenfeld A.  

Graphical Models, Vol. 62, Iss. 5, 2000-09 ,pp. : 343-352

Elsevier

Access to resources Recommend Favorite

Reconstructing convex polyominoes from horizontal and vertical projections

By Barcucci E.   Del Lungo A.   Nivat M.   Pinzani R.  

Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. : 321-347

Elsevier

Access to resources Recommend Favorite

Well-positioned Closed Convex Sets and Well-positioned Closed Convex Functions

By Adly Samir   Ernst Emil   Théra Michel  

Journal of Global Optimization, Vol. 29, Iss. 4, 2004-08 ,pp. : 337-351

Springer Publishing Company

Access to resources Recommend Favorite

On Differentiability of Metric Projections onto Moving Convex Sets

By Dentcheva D.  

Annals of Operations Research, Vol. 101, Iss. 1-4, 2001-01 ,pp. : 283-298

Springer Publishing Company

Access to resources Recommend Favorite

Satisfying constraint sets through convex envelopes

By Santos Eugene  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 18, Iss. 3, 2006-09 ,pp. : 413-432

Taylor & Francis Ltd

Access to resources Recommend Favorite