Sciweavers

584 search results - page 27 / 117
» On the Number of Halving Planes
Sort
View
JGT
2007
73views more  JGT 2007»
13 years 9 months ago
New bounds on the edge number of a k-map graph
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
Zhi-Zhong Chen
AVSS
2007
IEEE
14 years 4 months ago
Accurate self-calibration of two cameras by observations of a moving person on a ground plane
A calibration algorithm of two cameras using observations of a moving person is presented. Similar methods have been proposed for self-calibration with a single camera, but intern...
Tsuhan Chen, Alberto Del Bimbo, Federico Pernici, ...
XIMEP
2005
ACM
150views Database» more  XIMEP 2005»
14 years 3 months ago
Updating the Pre/Post Plane in MonetDB/XQuery
We outline an efficient ACID-compliant mechanism for structural inserts and deletes in relational XML document storage that uses a region based pre/size/level encoding (equivalent...
Peter A. Boncz, Stefan Manegold, Jan Rittinger
SWAT
1998
Springer
110views Algorithms» more  SWAT 1998»
14 years 2 months ago
On the Number of Regular Vertices of the Union of Jordan Regions
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
Boris Aronov, Alon Efrat, Dan Halperin, Micha Shar...
COMPGEOM
1990
ACM
14 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