Searched refs:cameras (Results 1 - 19 of 19) sorted by relevance

/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/
H A DTerrainLodControl.java55 * It needs the cameras to do this, and there could possibly
56 * be several cameras in the scene, so it accepts a list
57 * of cameras.
71 private List<Camera> cameras; field in class:TerrainLodControl
83 this.cameras = cams;
90 * @param cameras one or more cameras to reference for LOD calc
92 public TerrainLodControl(Terrain terrain, List<Camera> cameras) { argument
94 this.cameras = cameras;
154 setCameras(List<Camera> cameras) argument
[all...]
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowCamera.java28 private static Map<Integer, Camera.CameraInfo> cameras = new HashMap<Integer,Camera.CameraInfo>(); field in class:ShadowCamera
104 Camera.CameraInfo foundCam = cameras.get( cameraId );
111 return cameras.size();
143 * the existence of one or more cameras. By default, no
144 * cameras are defined.
150 cameras.put(id, camInfo);
154 cameras.clear();
/external/ceres-solver/examples/
H A Dbundle_adjuster.cc41 // a set of cameras P_1, ..., P_m. If the point X_i is visible in
78 "automatic, cameras, points, cameras,points, points,cameras");
141 double* cameras = bal_problem->mutable_cameras(); local
146 if (FLAGS_blocks_for_inner_iterations == "cameras") {
150 options->inner_iteration_ordering->AddElementToGroup(cameras + camera_block_size * i, 0);
158 } else if (FLAGS_blocks_for_inner_iterations == "cameras,points") {
162 options->inner_iteration_ordering->AddElementToGroup(cameras + camera_block_size * i, 0);
167 } else if (FLAGS_blocks_for_inner_iterations == "points,cameras") {
245 double* cameras = bal_problem->mutable_cameras(); local
[all...]
H A Dbal_problem.cc248 double* cameras = mutable_cameras(); local
252 double* camera = cameras + camera_block_size() * i;
/external/jmonkeyengine/engine/src/core/com/jme3/cinematic/
H A DCinematic.java68 private Map<String, CameraNode> cameras = new HashMap<String, CameraNode>(); field in class:Cinematic
136 oc.writeStringSavableMap(cameras, "cameras", null);
147 cameras = (Map<String, CameraNode>) ic.readStringSavableMap("cameras", null);
281 cameras.put(cameraName, node);
287 return cameras.get(cameraName);
298 currentCam = cameras.get(cameraName);
/external/jmonkeyengine/engine/src/blender/com/jme3/asset/
H A DBlenderKey.java502 /** All cameras from the file. */
503 private List<Camera> cameras; field in class:BlenderKey.LoadingResults
531 cameras = new ArrayList<Camera>();
597 if (cameras != null) {
598 cameras.add(camera);
655 * This method returns all loaded cameras.
656 * @return all loaded cameras
659 return cameras;
/external/jmonkeyengine/engine/src/test/jme3test/helloworld/
H A DHelloTerrainCollision.java142 List<Camera> cameras = new ArrayList<Camera>();
143 cameras.add(getCamera());
144 TerrainLodControl control = new TerrainLodControl(terrain, cameras);
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/cameras/
H A DCameraHelper.java1 package com.jme3.scene.plugins.blender.cameras;
13 * A class that is used to load cameras into the scene.
/external/ceres-solver/internal/ceres/
H A Dsystem_test.cc35 // adjustment problem with 16 cameras and two thousand cameras. The
372 double* cameras = mutable_cameras(); local
385 double* camera = cameras + 9 * camera_index_[i];
392 // The points come before the cameras.
398 options_.linear_solver_ordering->AddElementToGroup(cameras + 9 * i, 1);
/external/jmonkeyengine/engine/src/test/jme3test/bullet/
H A DTestHoveringTank.java285 List<Camera> cameras = new ArrayList<Camera>();
286 cameras.add(getCamera());
287 TerrainLodControl control = new TerrainLodControl(terrain, cameras);
H A DTestWalkingChar.java281 List<Camera> cameras = new ArrayList<Camera>();
282 cameras.add(getCamera());
283 TerrainLodControl control = new TerrainLodControl(terrain, cameras);
/external/jmonkeyengine/engine/src/test/jme3test/terrain/
H A DTerrainGridAlphaMapTest.java161 List<Camera> cameras = new ArrayList<Camera>();
162 cameras.add(this.getCamera());
163 TerrainLodControl control = new TerrainLodControl(this.terrain, cameras);
/external/jmonkeyengine/engine/src/test/jme3test/post/
H A DTestDepthOfField.java174 List<Camera> cameras = new ArrayList<Camera>();
175 cameras.add(getCamera());
/external/jmonkeyengine/engine/src/test/jme3test/water/
H A DTestPostWater.java262 List<Camera> cameras = new ArrayList<Camera>();
263 cameras.add(getCamera());
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/
H A DAbstractBlenderLoader.java45 import com.jme3.scene.plugins.blender.cameras.CameraHelper;
H A DBlenderLoader.java46 import com.jme3.scene.plugins.blender.cameras.CameraHelper;
/external/ceres-solver/docs/
H A Dbundleadjustment.tex72 // parameters for cameras and points are added automatically.
H A Dsolving.tex261 Suppose that the SfM problem consists of $p$ cameras and $q$ points and the variable vector $x$ has the block structure $x = [y_{1},\hdots,y_{p},z_{1},\hdots,z_{q}]$. Where, $y$ and $z$ correspond to camera and point parameters, respectively. Further, let the camera blocks be of size $c$ and the point blocks be of size $s$ (for most problems $c$ = $6$--$9$ and $s = 3$). Ceres does not impose any constancy requirement on these block sizes, but choosing them to be constant simplifies the exposition.
296 is the Schur complement of $C$ in $H$. It is also known as the {\em reduced camera matrix}, because the only variables participating in~\eqref{eq:schur} are the ones corresponding to the cameras. $S \in \reals^{pc\times pc}$ is a block structured symmetric positive definite matrix, with blocks of size $c\times c$. The block $S_{ij}$ corresponding to the pair of images $i$ and $j$ is non-zero if and only if the two images observe at least one common point.
299 Thus, the solution of what was an $n\times n$, $n=pc+qs$ linear system is reduced to the inversion of the block diagonal matrix $C$, a few matrix-matrix and matrix-vector multiplies, and the solution of block sparse $pc\times pc$ linear system~\eqref{eq:schur}. For almost all problems, the number of cameras is much smaller than the number of points, $p \ll q$, thus solving~\eqref{eq:schur} is significantly cheaper than solving~\eqref{eq:linear2}. This is the {\em Schur complement trick}~\cite{brown-58}.
309 cameras. Ceres implements this strategy as the \texttt{DENSE\_SCHUR} solver.
342 Equation~\eqref{eq:schurtrick1} is closely related to {\em Domain Decomposition methods} for solving large linear systems that arise in structural engineering and partial differential equations. In the language of Domain Decomposition, each point in a bundle adjustment problem is a domain, and the cameras form the interface between these domains. The iterative solution of the Schur complement then falls within the sub-category of techniques known as Iterative Sub-structuring~\cite{saad2003iterative,mathew2008domain}.
421 all the 3d points, and the second containing the all the cameras
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/objects/
H A DObjectHelper.java56 import com.jme3.scene.plugins.blender.cameras.CameraHelper;

Completed in 297 milliseconds