Computational Geometry logo Elsevier logo

Publisher: Elsevier

Related content
Volume 6, Number 2, May 1996

< previous issue | all issues | next issue >

Computing half-plane and strip discrepancy of planar point sets
pp. 69-83(15)
Authors: Beugelsdijk, T.J.; de Berg, M.

A computationally intractable problem on simplicial complexes
pp. 85-98(14)
Authors: Prasad, K.N.; Swaminathan, A.M.; Parkar, R.G.; Egecioglu, O.; Gonzalez, T.F.

Determining bar-representability for ordered weighted graphs
pp. 99-122(24)
Authors: Aharoni, Y.; Copel, A.; Gil, M.; Fallik, E.; Dunkerley, S.; Adams, M.J.; Kirkpatrick, D.G.; Wismath, S.K.

An algorithm for constructing the convex hull of a set of spheres in dimension d
pp. 123-130(8)
Authors: Vinod, V.V.; Ghose, S.; Hara, A.H.; Hata, T.Y.; Tenbrink, V.L.; Hu, B.K.; Kaneko, R.T.; Kim, B.; Boissonnat J.-D.; Cerezo, A.; devillers, O.; Duquesne, J.; Yvinec, M.

< previous issue | all issues | next issue >

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page