Farthest-point queries with geometric and combinatorial constraints

dc.creator	Daescu, Ovidiu	es
dc.creator	Mi, Ningfang	es
dc.creator	Shin, Chan-Su	es
dc.creator	Wolff, Alexander	es
dc.date.accessioned	2017-03-01T12:51:22Z
dc.date.available	2017-03-01T12:51:22Z
dc.date.issued	2004
dc.identifier.citation	Daescu, O., Mi, N., Shin, C. y Wolff, A. (2004). Farthest-point queries with geometric and combinatorial constraints. En 20th European Workshop on Computational Geometry, Sevilla.
dc.identifier.uri	http://hdl.handle.net/11441/55045
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.relation.ispartof	20th European Workshop on Computational Geometry (2004).
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	Farthest-point queries with geometric and combinatorial constraints	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dc.type.version	info:eu-repo/semantics/publishedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
idus.format.extent	4 p.	es
dc.eventtitle	20th European Workshop on Computational Geometry	es
dc.eventinstitution	Sevilla	es

Files	Size	Format	View	Description
Farthest-point queries with ...	133.1Kb	[PDF]	View/Open

Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional